title: Graph Implementation
body: <p>I need to create a graph implementation from input files of the type formatted below where S will be the starting node from which I will implement a number of search algorithms. My question is how I turn this into a graph, right now I have written code to read the input file into an array of strings (w/ each input into the array being a line of the maze).</p>
  
  <p>I was thinking I would then just find the starting node (where S is) and start building outward as I implement the search. Is this a better approach then creating all the nodes at the start? I will be using Python.</p>