Dijkstra's algorotihm in pbasic for the boe-bot
Hello Im doing a project with the boe-bot where my boe-bot will go through a maze twice the first run it goes through the entire maze including dead ends, then on the second run it will find the shortest path to the end of the maze. I want to use either the Dijkstra's algorithm or floyds algorithm to do this so I was wondering if anyone had these codes in pbasic. I am using the parallax infrared line follower with my boe-bot.