On 15/11/02 02:02 -0800, kishor bhagwat wrote:
hello guys, I'm facing a vexing problem...one of my colleagues is writing a network mgmt system thats queries our WAN devices, collects info on their 'neighbours' and is supposed to plot the topology of the network. so basically...the input to the plotting program would be a list of: nodeID,{set of its neighbours}
From this, it has to graphically plot the links.
I'll give an example of the issues...how do we know which node should be at the center? how about redundant links between the same two locations?
Does anyone know of any mathematical algorithms for solving such a problem? well..would be glad if anyone can help!
cheops? Older versions had source available, before it went closed source. I remember picking it up from the.wiretapped.net
Devdas Bhagat