Modify Algorithm 10.6.3 so that the output consists of the sequence of edges in the shortest path from a to z.

To prove:

If a connected weighted graph G is given as input to given algorithm, then the output will be a minimum spanning tree for G.

Given information:

Connected and weighted graph.

Concept used:

The given algorithm is:

Remove an edge from G which is having a maximal weight and at each stage G must be connected.

Proof:

The input of the algorithm is a connected graph G