Let the source and destination vertices be s and t.
We need to compute Best[s,t,10]. Best[x,y,t] is best path between x to y of
t hops.
The recurrence is
Best[u,v,m] = min_{over all u'} [ max {Distance(u,u'), Best[u',v, m-1]} ]
Best[u,v,1] is easy to calculate.
-Courtesy: http://www.careercup.com
On Fri, Feb 10, 2012 at 11:47 AM, praveen raj <[email protected]> wrote:
> choose greedy algorithm... in in minimum spanning tree..
>
> PRAVEEN RAJ
> DELHI COLLEGE OF ENGINEERING
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected].
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
With Regards
Manish Patel
BTech
Computer Science And Engineering
National Institute of Technology -Allahabad
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
