UVA 929  Number Maze Dijkstra based problem. We have already discussed Dijkstra algorithm for shortest path from source to destination here http://wikistack.com/shortest-path-problem-dijkstras-algorithm/. The given problem at this link https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=870 is based on Dijkstra’ algorithm. Let us practice it for applying Dijkstra algorithm.

UVA 929 Number Maze Dijkstra based problem

Your are give a maze filled with some numbers from 0 to 9, find the min cost to reach from top left corner to bottom right corner. The maze can be traversed following any orthogonal direction (i.e.,north, south, east and west).

Related Contents to follow