graph optimum path

I am writing a program that reads a two txt files...one is the graph specification which is the format

Page: Link ( could be more than one link)

and another file stating the start and end nodes of the graph path...

i am able to read the (sfnodes file) and store each node in the memory then go to the graph specification and search for the start node....is this the best way to do it..if so how am i able to read the links connected ... is doing it recursively the best way if so can someone show me an example....

help is much appreciated

thanks