So why not integrate your A and B point into the graph structure ? This way, you will have 4 edges: (1, A) (A, 2), (1, B) and (2, B)
Le lundi 16 janvier 2006 à 13:53 -0500, Fay Du a écrit : > Sorry, I forgot attachment in my previous email. > Fay > > -----Original Message----- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] On Behalf Of Sylvain > Pasche > Sent: Monday, January 16, 2006 12:59 PM > To: Cartoweb users > Subject: Re: [Cartoweb-users] ask for models which can descript > twosegments share end points > > Le lundi 16 janvier 2006 à 12:12 -0500, Fay Du a écrit : > > Hi all: > > > > After read boots.org page, I understand why pgdijkstra module does not > > allow two segments share end points (see attachment). The graph model > > it uses adjacency_list does not allow two segments share end points. > > May I know any other model which can model this kind of network? Many, > > many thinks. > > What's important to consider, is that if you intend to use this kind of > graph to perform shortest path computation, you can easily reduce it to > a graph which has only one edge connecting your two vertices. You just > need to consider the edge which has the lowest associated cost. This > should be garanteed that you get the right shortest path. > > Regards, > > Sylvain > > > _______________________________________________ > Cartoweb-users mailing list > [email protected] > http://lists.maptools.org/mailman/listinfo/cartoweb-users _______________________________________________ Cartoweb-users mailing list [email protected] http://lists.maptools.org/mailman/listinfo/cartoweb-users
