| Re: Multiple shortest paths? |
|
 |
|
 |
|
 |
|
 |
Group: uw.cs.cs341 · Group Profile
Author: Mina RazaghpourMina Razaghpour Date: Mar 19, 2008 06:23
It is possible to have multiple minimum time paths. To verify your output, compare
the time cost (note: not length) of your path and the path in the sample output.
-Mina
On Wed, 19 Mar 2008, Akshay Bharath wrote:
> For the sirius prblem, is it possible there there may be another shortest
> path? My program gives me an output with only 18 entries for the provided
> input!!
>
> -Sincerely,
> Akshay Bharath
>
| 
