Repository: tinkerpop Updated Branches: refs/heads/master b83d6e373 -> df4b3349d
Minor syntax fix to connectedComponent() recipe CTR Project: http://git-wip-us.apache.org/repos/asf/tinkerpop/repo Commit: http://git-wip-us.apache.org/repos/asf/tinkerpop/commit/df4b3349 Tree: http://git-wip-us.apache.org/repos/asf/tinkerpop/tree/df4b3349 Diff: http://git-wip-us.apache.org/repos/asf/tinkerpop/diff/df4b3349 Branch: refs/heads/master Commit: df4b3349d3cd0d54db4bfb99209b5c77fb690979 Parents: b83d6e3 Author: Stephen Mallette <[email protected]> Authored: Fri Aug 10 13:57:55 2018 -0400 Committer: Stephen Mallette <[email protected]> Committed: Fri Aug 10 13:57:55 2018 -0400 ---------------------------------------------------------------------- docs/src/recipes/connected-components.asciidoc | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/df4b3349/docs/src/recipes/connected-components.asciidoc ---------------------------------------------------------------------- diff --git a/docs/src/recipes/connected-components.asciidoc b/docs/src/recipes/connected-components.asciidoc index c46180f..000cda8 100644 --- a/docs/src/recipes/connected-components.asciidoc +++ b/docs/src/recipes/connected-components.asciidoc @@ -61,10 +61,11 @@ Connected components in a small graph can be determined with either an OLTP trav described in more detail in the link:http://tinkerpop.apache.org/docs/x.y.z/reference/#connectedcomponent-step[Reference Documentation]. The traversal looks like: + [gremlin-groovy,existing] ---- g.withComputer().V().connectedComponent(). - group().by(component). + group().by(ConnectedComponent.component). select(values).unfold() ---- @@ -81,6 +82,7 @@ g.V().emit(cyclicPath().or().not(both())). <1 by(path().unfold().dedup().fold()). <4> select(values).unfold() <5> ---- + <1> The initial emit() step allows for output of isolated vertices, in addition to the discovery of components as described in (2).
