Dijkstra's Algorithm for Finding Shortest Paths in a Graph This Python script implements Dijkstra's algorithm for finding the shortest paths from a source vertex to all other vertices in a graph.

Parallel Graph Algorithms on OpenStreetMap Networks This project implements and analyzes parallel versions of BFS and Dijkstra's shortest path algorithms on OpenStreetMap data. The implementation uses ...