[
https://issues.apache.org/jira/browse/TINKERPOP-1990?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16566620#comment-16566620
]
ASF GitHub Bot commented on TINKERPOP-1990:
-------------------------------------------
Github user spmallette commented on a diff in the pull request:
https://github.com/apache/tinkerpop/pull/882#discussion_r207183373
--- Diff: docs/src/recipes/shortest-path.asciidoc ---
@@ -48,6 +48,17 @@ course, it is possible for there to be more than one
path in the graph of the sa
length three), but this example is not considering that.
<2> It might be interesting to know the path lengths for all paths between
vertex "1" and "5".
<3> Alternatively, one might wish to do a path length distribution over
all the paths.
+<4> The preferred way to get a shortest path in OLAP is the
`shortestPath()` step.
--- End diff --
hmm - `<4>` doesn't refer to anything in the code above. did you mean to
add that callout?
> Add a shortestPath() step
> -------------------------
>
> Key: TINKERPOP-1990
> URL: https://issues.apache.org/jira/browse/TINKERPOP-1990
> Project: TinkerPop
> Issue Type: Improvement
> Components: process
> Reporter: Daniel Kuppitz
> Assignee: Daniel Kuppitz
> Priority: Major
>
> Implement {{ShortestPathVertexProgram}} and a {{shortestPath()}} step.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
