Fibonacci heap

Implementing a Fibonacci heap to find the shortest path for a provided set of a graph's edges and vertices.

Table of Contents

1. About The Project
2. Getting Started
   • Prerequisites
   • Installation
3. Help
4. Contact

About the project

In a weighted, undirected graph the shortest path problem is the problem of finding the shortest path connecting one vertex (the start vertex) to another vertex (the destination vertex).

To solve this problem, a Fibonacci heap can be used to implement a minimum priority queue that offers an efficient decrease key operation. By following the chain of predecessor pointers backwards from a destination to the source, we will be able to construct the shortest path from the source to the destination.

The objective of this program is to use a Fibonacci heap in order to use find the shortest path of a provided graph.

Getting Started

To get a local copy up and running follow these simple steps.

Prerequisites

Things you need to use the software.

• MacOS
• Xcode

Installation

Clone this repo.

git clone https://github.com/vmthanh-bi/Fibonacci-heap.git

Help

See the open issues for a list of proposed features (and known issues).

Contact

Tony Vu - @vmthanh.bi - vmthanh.bi@gmail.com

Project Link: https://github.com/vmthanh-bi/Fibonacci-heap