Off topic. It's about math. Don't read if you don't like math please.Thanks.

Off topic. It's about math. Don't read if you don't like math please.Thanks.

[Thai Dang Vu]

Hello,

I'm studying Computer Science master course and I'm looking for an
algorithm about finding the shortest path in a graph. This path must
passes every point in the graph and never passes a point twice. It
sounds like Dijikstra algorithm, but Dijikstra path doesn't pass all
points.

Do you have the name of that algorithm so that I can search for it on
Internet?

Thanks so much and sorry for an off topic letter.

Regards.

Re: Off topic. It's about math. Don't read if you don't like math please.Thanks.

[Drew Schaffner]

Try http://www.devx.com/sourcebank/

Drew Schaffner
Department of Bioengineering
University of California San Diego

perl -e 'print $i=pack(c5,(41*2),sqrt(7056),(unpack(c,H)-2),oct(115),10);'

On Thu, 25 Apr 2002, Thai Dang Vu wrote:

>
> Hello,
>
> I'm studying Computer Science master course and I'm looking for an
> algorithm about finding the shortest path in a graph. This path must
> passes every point in the graph and never passes a point twice. It
> sounds like Dijikstra algorithm, but Dijikstra path doesn't pass all
> points.
>
> Do you have the name of that algorithm so that I can search for it on
> Internet?
>
> Thanks so much and sorry for an off topic letter.
>
> Regards.
>

Re: Off topic. It's about math. Don't read if you don't like math please.Thanks.

[Ashish Gupta]

That would be all pairs shortes path algorithm .. see if you can find 
any interesting stuff at
http://www-unix.mcs.anl.gov/dbpp/text/node35.html
Cheers
Ashish


Thai Dang Vu wrote:

>Hello,
>
>I'm studying Computer Science master course and I'm looking for an
>algorithm about finding the shortest path in a graph. This path must
>passes every point in the graph and never passes a point twice. It
>sounds like Dijikstra algorithm, but Dijikstra path doesn't pass all
>points.
>
>Do you have the name of that algorithm so that I can search for it on
>Internet?
>
>Thanks so much and sorry for an off topic letter.
>
>Regards.
>
>
>

-- 
                     /////
                  \\  - -  //
                   (  @ @ )
   -------------oOOo--(_)-oOOo-----------
   Sincerely yours,
   Ashish Gupta
   -----------------------Ooooo----------
                          (   )
                 ooooO     ) /
                 (   )    (_/
                  \ (
                   \_)

RE: Off topic. It's about math. Don't read if you don't like math please.Thanks.

[Kaustubh Patil]

There is a classic problem called "Travelling Salesman Problem" in Computer
Algorithms. This is same as your problem.
I do not remember the name of the algorithm used to solve the problem. Lots
of them were suggessted.
Just search for algorithms to solve the Travelling Salesman Problem" and you
might get what you want.
If you get this algorithms that would solve your problem.

Kaustubh...
"Future is not what happens to you, but what you make out of it."


-----Original Message-----
From: Thai Dang Vu [mailto:thaid@Cybersoft-VN.com]
Sent: Thursday, April 25, 2002 8:39 AM
To: Gcc-Help (E-mail)
Subject: Off topic. It's about math. Don't read if you don't like math
please.Thanks.



Hello,

I'm studying Computer Science master course and I'm looking for an
algorithm about finding the shortest path in a graph. This path must
passes every point in the graph and never passes a point twice. It
sounds like Dijikstra algorithm, but Dijikstra path doesn't pass all
points.

Do you have the name of that algorithm so that I can search for it on
Internet?

Thanks so much and sorry for an off topic letter.

Regards.