Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Spanning tree

Theory

Finding a spanning tree in a graph

Report a typo

Given below is a connected unweighted graph:

Finding a spanning tree in a connected unweighted graph

Find a spanning tree in the graph and print all the edges of the spanning tree to the field below. Your output is expected to be in the following format (each line represents an edge):

0 1
2 3
4 5
6 7
8 9
5 9
3 10
Enter a short text
___

Create a free account to access the full topic