Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

A Fast Priority Queue Implementation of the Dijkstra Shortest Path Algorithm

, 4 Aug 2013 CPOL
Anyone needs a fast, efficient algorithm to compute the shortest path in C#? This article provides one.

Revisions


  

Compare Revision Minor Date Status Editor
3 - publicly available Yes 5-Aug-13 0:23 Available Tolga Birdal
Code has been updated considering Gianni Gardini's comment.
2 No 5-Aug-13 0:22 Available Tolga Birdal
Updates in content. Changes: 40
1 No 31-Mar-08 11:25 Available Smitha Vijayan

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

Tolga Birdal
CEO Gravi Information Technologies and Consultancy Ltd
Turkey Turkey
Currently, also an MSc. student in Technical University of Munich, I develop practical application in computer vision for more than 5 years. I design real-time solutions to industrial and practical vision problems, both 3D and 2D. Very interested in developing algorithms in C relating math and vision.
 
Please visit Gravi's web page (http://www.gravi.com.tr) and my page (http://www.tbirdal.me) to learn more about what we develop.
 
I admire performance in algorithms.
 
"Great minds never die, they just tend to infinity..."
Follow on   LinkedIn

| Advertise | Privacy | Terms of Use | Mobile
Web04 | 2.8.141223.1 | Last Updated 5 Aug 2013
Article Copyright 2008 by Tolga Birdal
Everything else Copyright © CodeProject, 1999-2014
Layout: fixed | fluid