You are given an algorithm that when given a graph, iteratively chooses the $n - 1$ edges of the graph, where $n$ is the number of nodes in the graph, such that the edges are chosen in order of increasing cost but an edge which creates a cycle in the graph with the previously chosen edges is not selected. The list of selected edges is then returned by the algorithm.

Which of the following problems can be solved using this algorithm?

Select an assignment template