Actually, I can not understand the idea of prunning backtracking with Floyd.
In backtracking, if I arrived to a node A from which the final node T is unreachable, still Floyd will give value
less than infinite, since from A I can reach T with some node I already used.
So, Floyd will not reject the ...
Search found 2 matches
- Sat Jun 19, 2010 1:47 am
- Forum: Volume 2 (200-299)
- Topic: 208 - Firetruck
- Replies: 48
- Views: 24667
- Wed May 26, 2010 4:32 am
- Forum: Volume 5 (500-599)
- Topic: 507 - Jill Rides Again
- Replies: 92
- Views: 44635
Re: 507 - Jill rides again
It definitely fits in an int.sazzadcsedu wrote:Can someone post me some I/O of this problem?? My program passed all the test case from the previous post. But still
WA. Plz someone help. Is int data type is enough for this problem???