PathFinding
This algorythm implements a breadth first search algorythm of my design to find
the shortest path to the blue house. It increments each seperate path first from right to left before continuing
while keeping into account the different tile types. The houses are untraversable, the vertical cable tiles can
be traversed up and down, the horizontale cable tiles can be navigated left or right, and the crossed cables
can be used in any direction. Once the house is reached the shortest path is highlighted for the user
to see.
You can download the java project here and run the project in a java environment like eclipse.