Graphs.jl contains a few algorithms to compute minimum spanning trees.
Pages = ["spanningtrees.md"]
Modules = [Graphs]
Pages = [
"spanningtrees/boruvka.jl",
"spanningtrees/kruskal.jl",
"spanningtrees/prim.jl",
"planarity.jl",
"spanningtrees/planar_maximally_filtered_graph.jl",
]