Figure 6 shows an example line graph. Like in the maze projects, nodes in a graph are represented by points and the edges are represented by lines of various colors. However, in this project,the edge weights are shown as floating point values on each line (in the maze, the distance between each block unit is assumed to be 1). Additionally, there may be more than four edges originating from a single node, and graphs in this project are not bounded by the same constraints as in the maze problem.