Re: [OT] Reverse-delete algorithm

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

[OT] Reverse-delete algorithm

Hi all, I am so frustrated about the code implementation of the Reverse-delete algorithm. Anyone has done that or know which codes I can take a reference. Sorry it's a bit OT, but I know no one around I can ask. Thanks very much, Best regards, -- To UNSUBSCRIBE, email to debian-user-requ...