A Special Matrix Power Operation Development for Simultaneous Calculation of All Network's Shortest Path

Download Now
Provided by: Journal of Theoretical and Applied Information Technology
Topic: Networking
Format: PDF
Network's shortest paths calculation is an important need in transportation network analysis. The Dijkstra algorithm has long been developed for the shortest path of a pair of nodes calculation individually. A more practical method to simultaneously calculate all shortest paths of all pair of nodes of a network needs to be developed. This paper presents the development of a method to calculate simultaneously all shortest paths of all pairs of nodes of a network. This calculation method, called a min-plus algebra, is a modification of max-plus algebra, having a special matrix power operation, enable and easier to be executed in spreadsheet software.
Download Now

Find By Topic