Edit - Geographic Information Systems Stack Exchange

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

Rev

It's a solution but it doesn't seem very efficient because pgr_drivingDistance will compute again each nodes for each new start node. What I'd like is that as in the dijkstra algorithm if a shortest path is found for a node, pgr_drivingDistance stop computing paths after this node for next start nodes.

Frederic Le Feurmou
– Frederic Le Feurmou

2013-09-27 08:46:18 +00:00
Commented Sep 27, 2013 at 8:46
@yowza Summing up the cost of the path is relatively insignificant compared to the cost of finding the shortest path in complicated networks so there's not much place for improvment.

Jakub Kania
– Jakub Kania

2013-09-27 12:28:46 +00:00
Commented Sep 27, 2013 at 12:28
Driving distance starts the computation from the start point and enlarges the resulting network until max cost is reached. In that way, it doesn't have to compute every node as your comment suggests.

tqhien
– tqhien

2013-09-27 14:05:40 +00:00
Commented Sep 27, 2013 at 14:05

Add a comment |

Correct minor typos or mistakes
Clarify meaning without changing it
Add related resources or links
Always respect the author’s intent
Don’t use edits to reply to the author

create code fences with backticks ` or tildes ~
```
like so
```
add language identifier to highlight code
```python
def function(foo):
print(foo)
```
put returns between paragraphs
for linebreak add 2 spaces at end
_italic_ or **bold**
indent code by 4 spaces
backtick escapes `like _so_`
quote by placing > at start of line
to make links (use https whenever possible)

<https://example.com>

[example](https://example.com)

<a href="https://example.com">example</a>

formatting help »
answering help »