A NOVEL APPROACH TO THE ALL- PAIRS SHORTEST PATH PROBLEM IN A DIRECTED Z- GRAPH
Proceedings of the Institute of Applied Mathematics · 2025
The classical Floyd's algorithm is used to find the shortest paths from each vertex to all other vertices.This article focuses on studying the all-pairs shortest path problem in a directed Z-graph.Therefore, a modified version of Floyd's algorithm is applied to find the shortest path between all vertices.