[pgrouting-users] A* or Shortest path for the whole network

[ahmed at elegantdesigns.ca]

Hey Anton,

* Screenshot: http://imgur.com/EwSGr

I want to create a shortest path between all nodes (101, 102, 103, 104),
first i need to connect the node(point) to the line-network and second i
need to compute the shortest path between all of them. The final result
should be similar too:

node_from, node_to, distance
-----------------------------
      101,     102, 5
      101,     103, 4
      101,     104, 7
      102,     103, 2.123
      102,     104, 45.32345
      103,     104, 5.12313

* note that I made the distance numbers up

* SQL FILES:

table nodes: http://pastie.org/599548
table edges: http://pastie.org/599546





On Sun, 30 Aug 2009 15:51:30 +0900, Anton Patrushev <anton at orkney.co.jp>
wrote:
> Hi,
> 
> I don't think I got your idea. Can you please post some sample data?
> 
> Anton.
> 
> On Sun, Aug 30, 2009 at 1:51 AM, <ahmed at elegantdesigns.ca> wrote:
>> Hey all,
>>
>> I have 2 postgis tables, one for the streets and the other for my zone
>> centroids. I'd like to create a travel_time matrix for the nodes. First,
>> I
>> need to connect my nodes to the road network; second I need to generate
>> all
>> the travel times between these nodes. I was wondering how can I solve
>> this
>> problem?
>> The output should be of the following format:
>>
>> node_id#, node_id#, travel_time
>>
>> cheers,
>> dassouki
>> _______________________________________________
>> Pgrouting-users mailing list
>> Pgrouting-users at lists.postlbs.org
>> http://lists.postlbs.org/mailman/listinfo/pgrouting-users
>>
> _______________________________________________
> Pgrouting-users mailing list
> Pgrouting-users at lists.postlbs.org
> http://lists.postlbs.org/mailman/listinfo/pgrouting-users