Spoj TRVCOST - Travelling cost

Spoj TRVCOST - Travelling cost

Problem Statement:-http://www.spoj.com/problems/TRVCOST/

Simple Dijkstra implementation.Be sure to make 500 cells(Vertex) because in inputs only edges i.e. roads are given.

Java Solution for this problem is given below.

Java Solution:-https://github.com/suyashbhalla/old_practice/blob/master/spoj/TRVCOST.java

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.

Java Solution: -https://github.com/suyashbhalla/old_practice/blob/master/spoj/MICEMAZE.java