Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Prim's algorithm

Theory

One step of the algorithm

Report a typo

Below is a weighted graph with a partly constructed minimum spanning tree (shown in blue):

Weighted graph with a partly constructed minimum spanning tree

Find all possible edges that can be chosen at the next step of Prim's algorithm. 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