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

Dijkstra's Algorithm for Network Optimization Using Fibonacci Heaps

, 23 Sep 2009 CPOL
This article presents the Fibonacci Heap data structure and shows how to use it for graph optimization.

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.


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


About the Author

Software Developer (Junior) SAP Research
Germany Germany
Since 2006 I study technical mathematics at Dresden University of Technology and since 2008 I work than working student at SAP Research in Dresden. My programming interests are developing and implementing algorithms for solving mathematical problems in C/C++, especially optimization.

| Advertise | Privacy | Terms of Use | Mobile
Web03 | 2.8.150327.1 | Last Updated 23 Sep 2009
Article Copyright 2009 by max3000
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid