algorithms_edu::algo::graph

Module minimum_spanning_tree

Modules§

kruskal: Kruskal’s algorithm for finding an miminum spanning forest.
prim: 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.