Spoj MICEMAZE - Mice and Maze Java Solution
Spoj MICEMAZE - Mice and Maze Java Solution
Problem Statement:-http://www.spoj.com/problems/MICEMAZE/
Hint: - Problem can be solved by Dijkstra Algorithm. Reverse the given edges and use the given end cell as source cell(starting cell) and then count the cells that can be reached within given time limit.Java Solution using Dijkstra algorithm link is given below.
Labels: Dijkstra Implementation, MICEMAZE.java, Spoj MICEMAZE - Mice and Maze Java Solution
0 Comments:
Post a Comment
Subscribe to Post Comments [Atom]
<< Home