algorithms_edu::algo::graph::minimum_spanning_tree

Module prim

Source
Expand description

An implementation of the eager version of Prim’s algorithm which relies on using an indexed priority queue data structure to query the next best edge.

§Resources