2017
DOI: 10.13005/ojcst/10.01.24
|View full text |Cite
|
Sign up to set email alerts
|

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

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 38 publications
(45 reference statements)
0
1
0
Order By: Relevance
“…Rasha Jalal Mitlif 5 describes an efficient algorithm for Fuzzy Linear Fractional Programming Problems via Ranking Function. Siddhartha Sankar Biswas 6 defines Z 1 as strongly greater than Z 2 as componentwise comparisons. Wen Jiang, ChunheXie, Yu Luo, and YongchuanTang 7 proposed a new method for ranking Z-numbers by evaluating generalized fuzzy numbers.…”
Section: Introductionmentioning
confidence: 99%
“…Rasha Jalal Mitlif 5 describes an efficient algorithm for Fuzzy Linear Fractional Programming Problems via Ranking Function. Siddhartha Sankar Biswas 6 defines Z 1 as strongly greater than Z 2 as componentwise comparisons. Wen Jiang, ChunheXie, Yu Luo, and YongchuanTang 7 proposed a new method for ranking Z-numbers by evaluating generalized fuzzy numbers.…”
Section: Introductionmentioning
confidence: 99%