Z-Dijkstra’s Algorithm to solve Shortest Path Problem in a Z-Graph
2017 ◽
Vol 10
(1)
◽
pp. 180-186
Keyword(s):
In this paper the author introduces the notion of Z-weighted graph or Z-graph in Graph Theory, considers the Shortest Path Problem (SPP) in a Z-graph. The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to Z-graphs. Consequently the author proposes a new algorithm called by Z-Dijkstra's Algorithm with the philosophy of the classical Dijkstra's Algorithm to solve the SPP in a Z-graph.
2014 ◽
Vol 21
(2)
◽
pp. 143
◽
2018 ◽
Vol 31
(3)
◽
pp. 175-187
◽
Keyword(s):
2003 ◽
Vol 29
(1)
◽
pp. 135-143
◽
Keyword(s):
2012 ◽
Vol 11
(4)
◽
pp. 345-359
◽
2019 ◽
Vol 1
(2)
◽
pp. 41-45
2020 ◽
Vol 1566
◽
pp. 012061
◽
Keyword(s):
2021 ◽
Vol 10
(10)
◽
pp. 216-221
2011 ◽
Vol 54
(0)
◽
pp. 58-83
Keyword(s):
Keyword(s):