This is an automated email from the ASF dual-hosted git repository.
spmallette pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/tinkerpop.git
The following commit(s) were added to refs/heads/master by this push:
new 6f07462 Added shortestPath() to upgrade docs CTR
6f07462 is described below
commit 6f074627bee36bed3bcbca2aab63486cf5ea002f
Author: Stephen Mallette <[email protected]>
AuthorDate: Tue Nov 20 09:04:40 2018 -0500
Added shortestPath() to upgrade docs CTR
---
docs/src/upgrade/release-3.4.x.asciidoc | 16 ++++++++++++++++
1 file changed, 16 insertions(+)
diff --git a/docs/src/upgrade/release-3.4.x.asciidoc
b/docs/src/upgrade/release-3.4.x.asciidoc
index bd9904f..a2dd2cc 100644
--- a/docs/src/upgrade/release-3.4.x.asciidoc
+++ b/docs/src/upgrade/release-3.4.x.asciidoc
@@ -247,6 +247,22 @@ release where breaking changes are allowed.
See: link:https://issues.apache.org/jira/browse/TINKERPOP-1975[TINKERPOP-1975],
link:http://tinkerpop.apache.org/docs/3.4.0/reference/#with-step[Reference
Documentation]
+==== shortestPath() Step
+
+Calculating the
link:https://en.wikipedia.org/wiki/Shortest_path_problem[shortest path] between
vertices is a common
+graph use case. While the traversal to determine a shortest path can be
expressed in Gremlin, this particular problem
+is common enough that the feature has been encapsulated into its own step,
demonstrated as follows:
+
+[source,text]
+----
+gremlin> g.withComputer().V().has('name','marko').
+......1> shortestPath().with(ShortestPath.target, has('name','peter'))
+==>[v[1],v[3],v[6]]
+----
+
+See: link:https://issues.apache.org/jira/browse/TINKERPOP-1990[TINKERPOP-1990],
+link:link:http://tinkerpop.apache.org/docs/3.4.0/reference/#shortestpath-step[Reference
Documentation]
+
==== connectedComponent() Step
In prior version of TinkerPop, it was recommended that the identification of
