Module pathfinding::undirected::prim

source ·
Expand description

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

Functions§

  • Find a minimum-spanning-tree. From a collection of weighted edges, return a vector of edges forming a minimum-spanning-tree.