Description: Dijkstra algorithm is a typical shortest path algorithm, used to calculate the shortest path of a node to all other nodes. The main features are the starting point as the center outward expansion of the layers, until the extension to the end point so far. Dijkstra algorithm can come up with the most short-circuit path of the optimal solution, but because a lot of it traversing the computing node, so the efficiency is low. Dijkstra algorithm is a step-by-step search algorithm, to work to keep up to find the shortest path from m to n for each vertex n. CSHARP realization algorithm
To Search:
- [qmc] - Quine Mc Cluskey Algorithm in C Sharp
- [Msearchha] - Maze search, A* algorithm, and automatic
File list (Check if you may need any files):
Ddijkstra-ci\dijkstra-c#.txt
Ddijkstra-ci
Download