Description: Dijkstra s algorithm, named after its discoverer, Dutch computer scientist Edsger Dijkstra, is a greedy algorithm that solves the single-source shortest path problem for a directed graph with non negative edge weights. For example, if the vertices (nodes) of the graph represent cities and edge weights represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between two cities. Also, this algorithm can be used for shortest path to destination in traffic network.
To Search:
File list (Check if you may need any files):
SPF\DijkstraAlgorithm\Dijkstra.cs
...\.................\DijkstraAlgorithm.csproj
...\.................\DijkstraAlgorithm.csproj.vspscc
...\.................\mssccprj.scc
...\.................\Properties\AssemblyInfo.cs
...\.................\..........\vssver2.scc
...\.................\vssver2.scc
...\DijkstraAlgorithm.sln
...\DijkstraAlgorithm.suo
...\DijkstraAlgorithm.vssscc
...\mssccprj.scc
...\DijkstraAlgorithm\bin\Debug
...\.................\bin
...\.................\Properties
...\DijkstraAlgorithm
SPF
Download