[GitHub] tinkerpop pull request #:

[dkuppitz <gi...@git.apache.org>]

Github user dkuppitz commented on the pull request:

    https://github.com/apache/tinkerpop/commit/e790e56aaa2118b07e36f2579502786bd9d79cc0#commitcomment-17828784
  
    In docs/src/recipes/centrality.asciidoc:
    In docs/src/recipes/centrality.asciidoc on line 100:
    The first three lines are a very optimistic way to select all shortest paths between each pair of vertices. It will work in TinkerGraph, but since TinkerPop doesn't guarantee a specific order of results, `.dedup()` could theoretically keep a path that is not the shortest path. I would use the same approach as in the betweeness centrality section.


---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at infrastructure@apache.org or file a JIRA ticket
with INFRA.
---