the map class

[b][red]This message was edited by ndapandula at 2004-4-30 11:21:26[/red][/b][hr]
I am using Dijkstras to find the shortest path from a certain node to a different node in a maze, the challege to this is that there are multiple of such paths and i want to print them all. Does anyone have a sound explanation as to how I cud go about this?

Does anyone know how to make a map empty, i.e clear all what's in it.

Sign In or Register to comment.

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!