Module pathfinding::undirected::kruskal

Find minimum-spanning-tree in an undirected graph using Kruskal’s algorithm.

Functions

• kruskal
  Find a minimum-spanning-tree. From a collection of weighted edges, return a vector of edges forming a minimum-spanning-tree.
• kruskal_indices
  Minimal-spanning-tree for nodes with integer indices. The nodes must have consecutives indices between 0 and number_of_nodes-1.