[algogeeks] Programming freaks

Hey programming freaks, Check this group out : http://groups.google.co.in/group/programming-challenges Good one discussing programming problems and algorithms. Cheers, AK --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google G

[algogeeks] Re: diameter of a graph

Hi all I dint get that one straight. Diameter is the dist. btw 2 farthest nodes la. ? So . wheres the Qn of pendant vertex and other stuffs come. ? Pls explain ur Soln ? -- Bala --~--~-~--~~~---~--~~ You received this message because you are subscribed to the G

[algogeeks] Please Vote For TajMahal online voting 16days15Hpurs Left To vote

click www.new7wonders.com and vote online For Election of new 7 wonders, please vote for Taj Mahal and make it a wonder Your vote counts! Help make history... and vote as many number of times as possible. and make voting itself an history. -- PRADEEP MACHARLA Ph:09411121457 --~--~-~

[algogeeks] Re: graph theory

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 somet

[algogeeks] graph theory

can anyone please tell me how to find single source longest path in a directed acyclic graph?? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@

[algogeeks] Re: Why we need prime numbers?

On 6/19/07, Bin Chen <[EMAIL PROTECTED]> wrote: > > > > > On Jun 15, 9:36 pm, Bart <[EMAIL PROTECTED]> wrote: > > > Top post means you reply other's thread in the top of the content. It > > > is regard as a rude behavior when in USENET. > > > Because not only you will reply the thread, you must let