The program requests for graph input file and finds friends that are connected via mutual friends or mutual colleges. It utitizes the following: queues, HashMap, graphs, and Dijkstra’s algorithm to runs shortest path between two friends as well as any adjacent friends.
Written as an assignment for Rutgers Data Stuctures(CS112).