Hello,
I am new to this website. I have recently made a C program, that can graphically simulate the finding of the shortest and 2nd shortest path in a weighted graph. This would be helpful in OSPF routing, where routers can route packets in the 2nd shortest path, if the shortest path has too much traffic. I have formulated the algorithm for finding the nth shortest path in general.To get the source code, visit www.planet-source-code.com.
Do tell me what you think. Thank you.