Flow-Of-Traffic

Customized and implemented Dijkstra’s and Ford Fulkerson’s algorithms to find a route between any two points in a graph with various vertices and edges. It deduces the shortest path to travel from the start to its destination.