Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Spanning tree

Theory

Finding MST in a graph

Report a typo

Given below is a connected weighted graph:

Finding MST in a connected weighted graph

Find a minimum spanning tree in the graph and print your answer to the field below. Your output is expected to be in the following format:

15
3 7
2 1
3 5
1 9
3 1

The first line contains the weight of a minimum spanning tree, the following lines contain the edges forming the spanning tree, each edge on a separate line.

Enter a short text
___

Create a free account to access the full topic