Implemented working bfs traversal algorithm which returns shortest path tree as a vector-> route between disconnected branches is not returned, and can be found with a helper function.
Rewritten linedata.txt to be accurate, index of each station is arbitrary. NEW LINEDATA.TXT DOES NOT WORK WITH CURRENT MAIN.CPP.
Current linedata.txt has missing stations, and has some unique stations sharing the same id. Currently, it represents a disconnected graph and cannot be fully traversed by BFS.
Implemented working bfs traversal algorithm which returns shortest path tree as a vector-> route between disconnected branches is not returned, and can be found with a helper function. Rewritten linedata.txt to be accurate, index of each station is arbitrary. NEW LINEDATA.TXT DOES NOT WORK WITH CURRENT MAIN.CPP. Current linedata.txt has missing stations, and has some unique stations sharing the same id. Currently, it represents a disconnected graph and cannot be fully traversed by BFS.