This is the mail archive of the
gcc-help@gcc.gnu.org
mailing list for the GCC project.
Re: Off topic. It's about math. Don't read if you don't like math please.Thanks.
- From: Ashish Gupta <ashishg at niksun dot com>
- To: Thai Dang Vu <thaid at Cybersoft-VN dot com>
- Cc: "Gcc-Help (E-mail)" <gcc-help at gcc dot gnu dot org>
- Date: Wed, 24 Apr 2002 23:31:02 -0400
- Subject: Re: Off topic. It's about math. Don't read if you don't like math please.Thanks.
- References: <B947031D966C464A9A4E6F567C73BA4D1C7BC8@hue.cybersoft.vn>
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 ) /
( ) (_/
\ (
\_)