Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Kruskal's algorithm

Theory

Adding edges to a spanning tree

Report a typo

Given below is an undirected weighted connected graph with a partly constructed spanning tree:

Adding edges to a spanning tree

Which edges with the weight 11 cannot be added to the current spanning tree? Print all such edges to the field below. Keep in mind that the blue edges are already added to the spanning tree, so you should not consider them.

Your output is expected to be in the following format (each edge on a separate line):

1 2
2 3
3 4
Enter a short text
___

Create a free account to access the full topic