<< back

Pearls In Graph Theory | Solution Manual

Given a weighted graph, find a subgraph that connects all vertices with the minimum total edge weight.