ipanagiotopoulos/BFSCompressedSparseRows

A semester project in the course Data Structures,where the implementation of Breadth First Search takes place where files with node inputs are scanned by a command line programm.Consequently,after the graph is loaded succesfully the user can enter 2 nodes and the output to be returned is the existence of the path between them and the time of finding the path following the BFS traversal

Java