Finding Shortest Path between given nodes with respect to their properties by using Breadth First Search algorithm.
Input File -> Every node's properties have divided by tab character (\t). Be sure that node's properties have a tab character between each of them.
Output File -> Output will be displayed at console or you can reach from output.txt. The contents of the output also be reachable from input file's comment section.