ShortestPath_Djikstra

Given a grid of size M * N, The goal is to find the min route to get to O=> Objective from S=> Source while skipping all the X=> blockades.There maybe multiple min routes. Pick anyone min route in this case.