Originally Posted by rabidgnome229 ![]() Read the file in as a map where each node is connected to four others (the node representing the pixels above, below, left and right). Then use either DFS or BFS. Instead of searching for a goal node you stop each branch when it encounters a colored node. |