Answer
Expressing the algorithm devised algorithm for finding a spanning tree with minimal weight containing a specified set of edges in a
connected weighted undirected simple graph.
Work Step by Step
Same as Kruskal’s algorithm,
- except start with
T := this set of edges and iterate from i = 1 to i = n − 1 − s,
- where s is the number of edges you start with.
