Possible path algorithms

Article View: comp.lang.misc

Article #1277

#1277

From: Martin A Miller
Date: Fri, 15 Jun 1990 20:17

43 lines
2052 bytes

Greetings,

I am looking for hints, suggestions, or pointers to reference material
on "possible path algorithms".

I have a 2 dimensional grid m rows long and n columns wide.  In one
corner I have point A, and in another corner point B.  The
coordinates of A might be (m,1) and point B might be (1,n).

                       1                     n

                      -------------------------
                   1  | | | | | | | | | | | |B|
                      | | | | | | | | | | | | |
                      | | | | | | | | | | | | |
                      | | | | | | | | | | | | |
                      | | | | | | | | | | | | |
                      | | | | | | | | | | | | |
                   m  |A| | | | | | | | | | | |
                      -------------------------


What I need is an algorithm which will systematically traverse every possible
path from point A to point B.  The following rule applies: traversal must
be always "forward" from point A (which implies that a location cannot be
visited twice in the same traversal).

If you can assist, please email (although I will post if there is any
interest).  If you cannot (for some reason) email, note the follow-up
newsgroup in this post.  BTW, I am cross posting this to comp.lang.pascal
since I will be implementing the algorithm in pascal.

thanks in advance..

-mm

Martin A. Miller
Programmer/Consultant
University of Wisconsin-Milwaukee
Internet: martin@csd4.csd.uwm.edu
Bitnet  : martin%csd4.csd.uwm.edu@INTERBIT
UUCP    : uunet!martin@csd4.csd.uwm.edu

Technical Details

Message-ID: <4500@uwm.edu>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rutgers!uwm.edu!csd4.csd.uwm.edu!martin

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rutgers!uwm.edu!csd4.csd.uwm.edu!martin
From: martin@csd4.csd.uwm.edu (Martin A Miller)
Newsgroups: comp.lang.misc,comp.lang.pascal,comp.graphics
Subject: Possible path algorithms
Message-ID: <4500@uwm.edu>
Date: 15 Jun 90 20:17:17 GMT
Sender: news@uwm.edu
Reply-To: martin@csd4.csd.uwm.edu (Martin A Miller)
Followup-To: comp.graphics
Distribution: usa
Organization: University of Wisconsin-Milwaukee
Lines: 43