Grid Solver - Need an Efficient program for the map attached

Please suggest a program for Identifying the shortest path by avoiding the blocking nodes(black junction) .
Main problem being the inability of the the bot to detect the bridges in between .
Urgent !!

You'll probably get a better grade for your class if you come up with the algorithm yourself, plus as a bonus you'll learn a lot about solving the problem and gain some skills that will be useful in the future.

Yes there have been a few people lately wanting us to do their calss assignments. Best if you research how to do it. Also the urgent bit means you have probably left it too late to start.

Main problem being the inability of the the bot to detect the bridges in between .

How does it detect the rest ?

No clue how that'd work, but maybe implement the right hand rule? Take every right turn until you reach the target, then backtrack an erase the unneccesary turns where it comes back on itself not sure how easy it is, more of a hopefully helpful idea