finding-shortest-paths-using-Dijkstra-s-algorithm
untilhamza/finding-shortest-paths-using-Dijkstra-s-algorithm
C
A personal project after studying data structures. It employs the priority queue, adjacent lists, sets, hash tables, graphs data structures to find the shortest paths that can be followed from any chosen vertex to all the other vertices in the graph.