IFZ-Graph and Extracting Shortest Path by IFZ-Dijkstra's Algorithm

Main Article Content

Siddhartha Sankar Biswas

Abstract

In this paper the author introduces the notion of IFZ-graph in Graph Theory. The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to IFZ-graphs. Consequently the author proposes a new algorithm called by IFZ-Dijkstra's Algorithm to solve the Shortest Path Problem (SPP) in an IFZ-graph. Keywords: Z-number, Z-distance, Z-graph, IFZ-number, IFZ-distance, IFZ-graph, IFZ-Dijkstra's

Downloads

Download data is not yet available.

Article Details

Section
Articles