On 6/20/07, mirchi <[EMAIL PROTECTED]> wrote: > > > can anyone please tell me how to find > single source longest path in a directed acyclic graph?? > > > > > If all edges are non-negative, you can use Dijkstra's Algorithm. Otherwise a simple Bellman-Ford should do. But if you are looking for something faster, take a look at the section on DAG Shortest Paths in Introduction to Algorithms by Cormen. There's also a brief explanation at http://www.comp.nus.edu.sg/~stevenha/myteaching/notes/9_graph5.html
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
