+1 vote
62 views
We have algorithms like djikstras,bellman ford etc which are used as shortest path algortihms .

What are the practical / real time applications of such algorithms

Thanks
asked Apr 26, 2016 in Computer Science - IT by techdoubt | 62 views

1 Answer

+2 votes
Some algorithm examples dealing with Shortest Path problem include :
1. Djikstras
2. Bellman-Ford
3. Floyd Warshall
4. Johnsons Algorithm

As the name denotes they are used to find short path from A to B , where locations A , B can be taken as nodes in internet ,

i.e shortest path to transfer packets from client to server locations ,also used in routing protocols over network
answered Apr 26, 2016 by slow_learner