Project Introduction

In this project, I implemented Dijikstra algorithm to find the length of a shortest path from a given source to each of the remaining vertices in an undirected graph, using leftist tree data structure as well as Fibonnaci heap, and measure the relative performance of the two implementations.

The amortized complexity is as follows