Tutorial about sortest path in graph. Programming Software Development by Gà_1 … with "2)" but with the Dijsktra method** program Dijsktra; const fi='Dijsktra.ip'; fo='Dijsktra.op'; ma=100; inf=30000; var n… between 2 vertices but must though a define vertex by Dijsktra method** program GraphPlus; const fi='D:\GP.inp'; fo='D… Re: Query about the shortest path for routing Hardware and Software Networking by ryan461 Sounds like a lot of work for a school project. But maybe take a look at the dijsktra algorithm to get you started. Its used in OSPF and ISIS [url]http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm[/url] Re: Query about the shortest path for routing Hardware and Software Networking by brandonrunyon This all falls under the category of Graph Theory... no? I would imagine looking into path finding algorithms like Dijsktra's would be a good place to focus on since so many routers use it. Re: Tutorial about sortest path in graph. Programming Software Development by SalmiSoft Good to see some activity here, so thumbs up for posting this. Should it be under Tutorials? One suggestion I would make is to use more meaningful variable names. The code would be much easier to scan and you would not need comments to explain what your variables are for. Rather than: n,s,e:byte; //n: number of vertices, s: start vertex, e: …