Algorithm - Searching all loops in a network topology -
I have been given the network set by nodes and links. I have to find all the ends in the network No coordinates will be given for the nodes.
Is there an existing algorithm or library that can do this? Or can you give me some ideas on how I can reach this problem? I am programming at NAT.
I understand what I want
Try
< P> This algorithm searches the shortest path for all other nodes in a network from a node.
Comments
Post a Comment