Dijkstra's Algorithm for Network Optimization Using Fibonacci Heaps

max3000

Rate me:

4.41/5 (15 votes)

23 Sep 2009CPOL5 min read

83.6K

3.3K

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

Views

Daily Counts

Downloads

Weekly Counts

License

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

Written By

max3000

Software Developer (Junior) SAP Research

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.

Dijkstra's Algorithm for Network Optimization Using Fibonacci Heaps

Views

Downloads

License

Comments and Discussions