From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 16384 invoked by alias); 25 Apr 2002 03:08:09 -0000 Mailing-List: contact gcc-help-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-help-owner@gcc.gnu.org Received: (qmail 16356 invoked from network); 25 Apr 2002 03:08:02 -0000 Received: from unknown (HELO Hanoi.Cybersoft-vn.com) (203.162.52.75) by sources.redhat.com with SMTP; 25 Apr 2002 03:08:02 -0000 Received: from hue.cybersoft.vn [192.168.200.6] by cybersoft-vn.com [192.168.200.4] with SMTP (MDaemon.v3.1.1.R) for ; Thu, 25 Apr 2002 10:08:42 +0700 content-class: urn:content-classes:message Subject: Off topic. It's about math. Don't read if you don't like math please.Thanks. MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable X-MimeOLE: Produced By Microsoft Exchange V6.0.4712.0 Date: Wed, 24 Apr 2002 20:23:00 -0000 Message-ID: X-MS-Has-Attach: X-MS-TNEF-Correlator: From: "Thai Dang Vu" To: "Gcc-Help (E-mail)" X-MDRcpt-To: gcc-help@gcc.gnu.org X-MDRemoteIP: 192.168.200.6 X-Return-Path: thaid@Cybersoft-VN.com X-MDaemon-Deliver-To: gcc-help@gcc.gnu.org X-SW-Source: 2002-04/txt/msg00273.txt.bz2 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.