Learn how to find out minimum spanning tree (MST) using Kruskal's algorithm in C++. Know more about Spanning tree, Minimum spanning tree etc.
pythongolangneedleman-wunschhuffman-algorithmdynamic-programminggreedy-algorithmsdisjoint-setknapsack-problemkruskal-algorithmprim-algorithmunion-findprims-algorithmbellman-ford-algorithmfloyd-warshall-algorithmoptimal-binary-search-treecoursera-algorithms-specializationalgorithms-illuminatedweighted-independent-set ...
1#include<iostream>2#include<algorithm>3#include<cmath>4#include<cstdio>5usingnamespacestd;6#definemaxn 3007#defineINF 0x3fffffff8intpar[maxn];9intn,m;1011structnode12{13intx;14inty;15intw;16};17node e[maxn * maxn /2];18intcmp(constnode& a,constnode &b)19{20returna.w <b.w...
Kruskal MST https://github.com/xtaci/algorithms/blob/master/include/kruskal_mst.h Breadth First Search https://github.com/xtaci/algorithms/blob/master/include/graph_search.h Depth First Search https://github.com/xtaci/algorithms/blob/master/include/graph_search.h Dijkstra's algorithm https://gith...