Reverse-delete Algorithm - Pseudocode

Pseudocode

1 function ReverseDelete(edges E) 2 sort E in decreasing order 3 Define an index i ← 0 4 while i < size(E) 5 Define edge temp ← E 6 delete E 7 if temp.v1 is not connected to temp.v2 8 E ← temp 9 i ← i + 1 10 return edges E

In the above the graph is the set of edges E with each edge containing a weight and connected vertices v1 and v2.