spoj MICEMAZE – Mice and Maze

this problem can be solved using a direct Implementation of Floyd-Warshall’s algorithm(complexity ). If the graph is undirected it is better to solve it using Dijkstra’s Algorithm(complexity Screenshot from 2015-03-28 17:58:14). But unfortunately it is directed graph

https://gist.github.com/53d105c33e3af7c5fc88

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s