Minimum spanning tree algorithms

Home > Computer Science > Algorithms and data structures > Graph Traversal > Minimum spanning tree algorithms

Algorithms for finding the tree that connects all nodes in a graph with the minimum total weight, such as Prim's algorithm or Kruskal's algorithm.