to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Anil Kishore
...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Anil Kishore
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Anil Kishore
--
You received this message
...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Anil Kishore
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Anil Kishore
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email
No. The normal Dijkstra's cannot be modified to work for longest path, as
you can see the optimal subproblem problem is not satisfied. While the
Dijkstra's shortest path can be computed in polynomial time, the longest
path cannot be ( NP complete ). I'm sure there are lot of resources on net.
May
If you negate the values, then it will loop on forever in a cycle, as adding
more negative values *seems* to give shorter path.
2010/1/15 chitta koushik koushik.infin...@gmail.com
How abt negating values and using same single source shortest path algo ?
2010/1/15 saltycookie
