Shortest path Dijkstra algorithm

Ahmad Al-Ahmad, Ibraheem Ahmaro, Malik Mustafa


The shortest path problem is a fundamental problem with numerous applications. In this paper we study one of the most common variants of the problem, where the goal is to find a point-to point shortest path in a weighted, directed graph.

Full Text: PDF


  • There are currently no refbacks.