Abstract
Finding an optimal path in a graph. This task is quite common in everyday life and in the world of technology. Dijkstra's Algorithm works on oriented (with some additions and on undirected) graphs, and is designed to search for the shortest paths between a given vertex and all other vertices in the graph. on an undirected graph, where we will search for the shortest path using Dijkstra's Algorithm.
References
Zhan, F. Benjamin; Noon, Charles E. (February 1998). "Shortest Path Algorithms: An Evaluation Using Real Road Networks". Transportation Science. 32 (1): 65–73.
S. Lakshmivarahan S., J. S. Jwo, S. K. Dhall. Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey. // Parallel Comput. – V. 19. – 1993. – P. 361–407.
S. B. Akers, B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. // IEEE Trans. Comput. – V. 38. – 1989. P. 555–566.
J. S. Jwo, S. Lakshmivarahan, S. K. Dhall. Embedding of cycles and grids in star graphs. // J. Circuits Syst. Comput. – V. 1. – 1991. – P. 43–74.
Thorup, Mikkel (2000). "On RAM priority Queues". SIAM Journal on Computing. 30 (1): 86–109
Y.-Q. Feng. Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets. // Journal of Combinatorial Theory, Series B. – V. 96. – 2006. – P. 67—72.