Module pathfinding::undirected

Algorithms for undirected graphs.

Modules

connected_components	Separate components of an undirected graph into disjoint sets.
kruskal	Find minimum-spanning-tree in an undirected graph using Kruskal’s algorithm.