Skip to main content

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.

2
  • i tried to re-read the latest pgrouting workshop tutorial, workshop.pgrouting.org/chapters/shortest_path.html, then i notice under the note tag on each routing algorithm, it mentions this "Undirected graphs (“directed false”) ignore “has_reverse_cost” setting" what exactly does try to tell me? that if i want either directed or undirected graph, just set the directed accordingly and ignore the has_reverse_cost? Commented Jan 16, 2013 at 4:01
  • Not quite. For an undirected graph set False False. For a directed graph make sure you have a 'reverse-cost' attribute and set True True. Commented Jan 16, 2013 at 8:51