dijkra's algorithms gives the shortest path between two nodes, but you can enumerate all paths using that method. when adding a new node you have to check whether there is a way from the last ( not the closest ) node to new added one, if so, then print out the answer, till the last node is added to the spanning tree.
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
