I think Floyd Bellman method can solve it. We can get any pair vertex distance and find the largest one. That's the diameter of a graph. But this method is not DP but iterative approach.
On Sep 1, 2:55 pm, mirchi <[EMAIL PROTECTED]> wrote: > can anyone explain me how to find the diameter of a graph using > dyanamic programming ? > thanks in advance... --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
