Digraph class with a breadth first search and a dijkstra algorithm for finding paths with weighted edges. To compile and run from terminal simply type: g++ -o main.out main.cpp && ./main.out inputFile2.txt
A text file in the format as inputFile2.txt is required to input graph vertex connection data.