[
https://issues.apache.org/jira/browse/TINKERPOP-1614?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15878809#comment-15878809
]
stephen mallette commented on TINKERPOP-1614:
---------------------------------------------
there is a reference to {{V/E(ids...)}} in the links i add to "The Graph
Process" -
http://tinkerpop.apache.org/docs/current/reference/#_the_graph_process
> Improve documentation for Graph.V() and Graph.E() on main docs page
> -------------------------------------------------------------------
>
> Key: TINKERPOP-1614
> URL: https://issues.apache.org/jira/browse/TINKERPOP-1614
> Project: TinkerPop
> Issue Type: Improvement
> Components: documentation
> Reporter: Bob Briody
> Assignee: stephen mallette
> Fix For: 3.2.5
>
>
> I was trying to help someone out on stack overflow recently:
> http://stackoverflow.com/questions/41638792/dse-graph-get-all-edges-between-two-vertexes.
> I was on the main TinkerPop3 Docs page looking for some introduction to
> g.V() that would be good to copy/paste, but couldn't find anything.
> It seems like there might be a stepping stone missing between "The Traversal"
> and "Graph Traversal Steps" - a stepping stone about using V and E to
> seed/start a Traversal.
> The use of IDs should also be discussed there as well.
--
This message was sent by Atlassian JIRA
(v6.3.15#6346)
