Click here to Skip to main content
Click here to Skip to main content

Dijkstra's Algorithm for Network Optimization Using Fibonacci Heaps

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


Members may post updates or alternatives to this current article in order to show different approaches or add new features.

No alternatives have been posted.


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.

| | Privacy | Mobile
Web01 | 2.8.140821.2 | Last Updated 23 Sep 2009
Article Copyright 2009 by max3000
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid