Class node

CPP/graphseries.cpp:427–437

structure for kruskals algorithm and bellmenford algorithm

//structure for kruskals algorithm and bellmenford algorithm
struct node{
	int u;//first node
	int v;// second node
	int wt;// weight between the nodes

	node(int first,int second,int weight){
		u=first;
		v=second;
		wt=weight;
	}
};

//comparator for sorting vector of edges structure
bool comp(node a,node b){