[pgrouting-dev] Dijkstra's solution - How to get tree?

[Stephen Woodbridge]

Hi,

If I run a Dijkstra's solution:

Can I run it for some max distance?
How can I get the resulting tree?

I have a problem where I need to pick a start point and solve the graph 
for some max distance from the start node. I think this is similar to 
what is done for drive time analysis.

Any hints would be welcome and I'm not shy about hack some code if I 
know where to start looking.

Thanks,
   -Steve