Message-ID: <3A5AA913.77858383@home.com> From: Robin Johnson Organization: Orbis-Terrarum.Net X-Mailer: Mozilla 4.7 [en] (Win98; U) X-Accept-Language: en,af,es MIME-Version: 1.0 Newsgroups: comp.os.msdos.djgpp Subject: OT: Which newsgroup to ask an algorithm related programming question Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Lines: 39 Date: Tue, 09 Jan 2001 06:00:46 GMT NNTP-Posting-Host: 24.113.36.103 X-Complaints-To: abuse AT home DOT net X-Trace: news1.rdc1.bc.home.com 979020046 24.113.36.103 (Mon, 08 Jan 2001 22:00:46 PST) NNTP-Posting-Date: Mon, 08 Jan 2001 22:00:46 PST To: djgpp AT delorie DOT com DJ-Gateway: from newsgroup comp.os.msdos.djgpp Reply-To: djgpp AT delorie DOT com I haven't had any luck finding the right newsgroup to ask my question, so i'll ask it here in the hopes that some of the regulars can redirect me to the proper place, (or provide an answer anyway). I'm looking into writing a piece of software to aid with the local transit system, but I have hit a problem, I need a good algorithm (or easily modifiable) implementation of a shortest path algorithm for a one-pair set, in a system that will have many edges, and all positive weights, and it MUST record the path. I've look at both Dijkstra's & Bellman-Ford's algorithms, but I don't see how they can be modified to record the path. Also, although it would only really be a bonus to this, some hints on parallelizing the algorithm for speed reasons. Sorry about being OT, But I didn't have any luck with searching for it -- Robin Hugh Johnson "Robbat2" QTOD: "I used to be an idealist, but I got mugged by reality." E-Mail : robbat2 AT orbis-terrarum DOT net ICQ# : 30269588 or 41961639 Home Page : http://www.orbis-terrarum.net Time Zone : Pacific Daylight (GMT - 8) -----GEEK CODE-{--- Version: 3.12 GU/CS d a--- C++++ L++++ U*+++ E---- e* h! tv-- X+ W+++ N+++ w--- M- P+ R D++ V-- PS+ PE-- Y+ PGP++ r !y t-- 5 s+:- b+++ ---}-GEEK CODE----- -----PGP INFO-{--- Key ID:0x7E20DFA1 FingerPrint: 5447C73A 30FB144C 89521B69 2D6A615E 7E20DFA1 ---}-PGP INFO-----