A matrix method of solving shortest path using Dijkstra algorithm

Yongwen Hu · Journal of Henan Polytechnic University · 2011

This paper is connected with the shortest path problem.A matrix method is proposed to solve the problem using Dijkstra algorithm,which can directly get the distance and the path from the source node to other nodes with simple calculation and label in weight matrix.The method can be easily completed on computer.

Read the paper · More papers on PaperTik