Oriental Journal of Computer Science and Technology

Open Access Open Access  Restricted Access Subscription Access

Z-Dijkstra’s Algorithm to solve Shortest Path Problem in a Z-Graph


Affiliations
1 Department of Computer Science and Engineering, Jamia Hamdard University Hamdard Nagar, New Delhi – 110062, India
 

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.


Keywords

Z-Number, Z-Distance, Z-Weighted Graph, Z-Graph, Z-Dijkstra's.
User
Notifications
Font Size


  • Z-Dijkstra’s Algorithm to solve Shortest Path Problem in a Z-Graph

Abstract Views: 390  |  PDF Views: 3

Authors

Siddhartha Sankar Biswas
Department of Computer Science and Engineering, Jamia Hamdard University Hamdard Nagar, New Delhi – 110062, India

Abstract


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.


Keywords


Z-Number, Z-Distance, Z-Weighted Graph, Z-Graph, Z-Dijkstra's.

References





DOI: https://doi.org/10.13005/ojcst%2F10.01.24