dijkstra can be applied for longest path....if there is no cycle..
now assuming that it is directed acyclic graph(DAG)
if u multiply all weights by -1...means all weights are negative..then apply
dijkstra for shortest path and u will get your answer....
--
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 to algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
