Introduction
The following article exemplifies a .NET implementation of Dijkstra’s for finding the minimum distance path between two nodes in a connected, undirected graph. For the purpose, the technologies that have been used are .NET 4.0, Visual Studio 10, and WPF for the graphical user interface.
Background
The basic elements of every graph are the node and the edge. In general, a graph is an abstraction that could represent anything. The easiest way to think of it (especially for this article) is as a map whereby the nodes are cities and the edges are the connected roads. However, graphs can be used to represent other things as well.
转至:
相关链接