Dijkstra algorithm is typical of shortest path algorithm, is used to calculate the shortest path of one node to all other nodes. Main features are the starting point for the Centre to the outer layers expand, until the extension up to the end. Can work out the shortest path by Dijkstra algorithm optimal solution, but because of it traversing the calculation of many, so inefficient. Dijkstra algorithm is a progressive search algorithms, adopted so far reserved for each vertex n find the shortest paths from m to n to work. CSHARP algorithm




File list:
dijkstra-c#.txt