[pgrouting-users] Question about driving_distance calculation

[Markus Innerebner]

Hi all,

I need some information about driving_distance calculation function:

1) the query point(source_id) has to be a vertex or can it be a 2D point 
that is mapped to the closest possible edge?
2) what happens with edges, that are partially reached? (one vertex is 
reached in time, the other one is not)
3) is the entire network loaded into main memory for doing such a 
computation?

thanks for your answer

best regards

Markus Innerebner