|Date: ||Mon, 8 Sep 2003 15:55:27 -0700|
|Reply-To: ||Shravan Kumar Durvasula <s_k_d_23@YAHOO.COM>|
|Sender: ||"SAS(r) Discussion" <SAS-L@LISTSERV.UGA.EDU>|
|From: ||Shravan Kumar Durvasula <s_k_d_23@YAHOO.COM>|
|Subject: ||Different Paths|
|Content-Type: ||text/plain; charset=ISO-8859-1|
I have a set of points in 2D space. Each of these points is joined to
atleast one another point. I need to find all the different possible
paths from a given point A to another given point B.
Could anyone please tell me if there is any algorithm to do this.
Best regards and thanks in advance,