From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 19635 invoked by alias); 26 Apr 2002 04:31:55 -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 19427 invoked from network); 26 Apr 2002 04:31:45 -0000 Received: from unknown (HELO pcsmail.patni.com) (203.124.139.197) by sources.redhat.com with SMTP; 26 Apr 2002 04:31:45 -0000 Received: from pcsbom.patni.com (pcsbom.patni.com [204.165.186.25]) by pcsmail.patni.com (8.9.3/8.9.3) with ESMTP id JAA19046 for ; Fri, 26 Apr 2002 09:57:11 +0530 Received: from pcsttc.patni.com (pcsttc.patni.com [199.92.207.2]) by pcsbom.patni.com (8.9.3/8.8.8) with ESMTP id JAA23147 for ; Fri, 26 Apr 2002 09:57:10 +0530 (IST) Received: from antivirgw (antivirgw.patni.com [192.168.12.45]) by pcsttc.patni.com (8.9.3/8.8.8) with SMTP id JAA19478 for ; Fri, 26 Apr 2002 09:57:10 +0530 (IST) Received: from amazon.patni.com ([192.168.12.4]) by antivirgw (NAVIEG 2.1 bld 66) with SMTP id M2002042609571023382 ; Fri, 26 Apr 2002 09:57:10 +0530 Received: from pcp3856 ([199.92.207.18]) by amazon.patni.com (8.9.3/SCO5) with SMTP id JAA21083; Fri, 26 Apr 2002 09:56:50 +0530 (IST) Reply-To: From: "Kaustubh Patil" To: "'Thai Dang Vu'" , "'Gcc-Help \(E-mail\)'" Subject: RE: Off topic. It's about math. Don't read if you don't like math please.Thanks. Date: Fri, 26 Apr 2002 03:44:00 -0000 Message-ID: <001101c1ecdc$e40779e0$306ad103@patni.com> MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4522.1200 In-Reply-To: X-SW-Source: 2002-04/txt/msg00298.txt.bz2 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.