Back to Work

# Shortest Path Finder (Dijkstra's algorithm)

## TL;DR: Java Implementation of Dijkstra's Algorithm

Java Implementation of Dijkstra's Algorithm

In this Java project, I implemented Dijkstra's algorithm to find the shortest path in a graph. Key to this implementation was the use of a HashMap for efficient storage and retrieval of node distances, coupled with a min-priority queue to optimally select the next node to visit. This combination ensured the algorithm efficiently handles large graphs, with a time complexity of O((V + E) log V), where V is the number of vertices and E is the number of edges. This project demonstrates my ability to apply advanced algorithms and data structures effectively, with a keen understanding of their computational complexity.