On 6/17/07, mirchi <[EMAIL PROTECTED]> wrote: > > can some one give me a dynamic programming algorithm to find the > diameter of a graph ...(directed acyclic graph) > thanx in advance.. >
Perform a depth-first search with the following state information for each node - "distance to farthest pendant vertex". -- Rajiv Mathews --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
