Click here to Skip to main content
15,884,627 members
Articles / Desktop Programming / WPF

Dijkstra's Minimum Distance

Rate me:
Please Sign up or sign in to vote.
4.80/5 (34 votes)
27 May 2012GPL36 min read 68.8K   5.7K   82  
A .NET implementation of Dijkstra’s for finding the minimum distance path between two nodes in a connected, undirected graph.
<Application x:Class="MinDistanceWpf.App"
             xmlns="http://schemas.microsoft.com/winfx/2006/xaml/presentation"
             xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml"
             StartupUri="MainWindow.xaml">
    <Application.Resources>
         
    </Application.Resources>
</Application>

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The GNU General Public License (GPLv3)


Written By
Software Developer
Bulgaria Bulgaria
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Comments and Discussions