Description: The Djkstra algorithm it gives you a headache from the programming point of view. In one step it finds the shortest path to every node in the graph. I will go into the graph background (basics) and then I will present the implementation of this algorithm. This example has also some advanced programming techniques and technologies. I used an ActiveX control (that it is actually the Dijkstra solver) and a container application that use the functions. Also, the lists are made using STL...
Resource Specification
Date Added:
01/29/2004
tr>
Last Updated:
01/29/2004
Author:
lgcip
Average Visitor Rating:4.05 (out of 5) Number of Ratings: 21 Votes
Tutorial Maniacs - C#, PHP, ASP, .NET, Photoshop, Flash, Fireworks, & other design and programming tutorials... The most comprehensive collection of QUALITY hand picked design and programming tutorials and articles...(C) 2003