#pragma once
#include"Graph.h"
#include<algorithm>
#include<list>
#include<vector>
#include<queue>
#include<set>

struct queue_cmp {
	bool operator()(Edge* a, Edge* b) {
		return a->weight > b->weight;
	}
};
class Mst
{
public:
	list<Edge* > kruskal(Graph& graph);
	set<Edge* >prim(Graph& graph,int start);
};