This project implements Dijkstra's shortest path algorithm using three different schemes: 1. simple scheme without using any complex data structure; 2. Binomial heap; 3. Fibonacci heap.