A Dijkstra algorithm implementation which is able to handle queries on big map (more than 110 MB). A course project for ECE 368.
- Implement Dijkstra algorithm for big graph with 200,000 vertices.
- More information
# Measure memory usage
make memory-compare
# Measure the time used to process queries.
make linux-compare