pub fn prim_mst(view: &GraphView) -> MSTResultExpand description
Prim’s Algorithm for Minimum Spanning Tree
Treats graph as undirected (ignores edge direction).
If graph is disconnected, returns MST of the component containing start_node
(or arbitrary node if not specified).