You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@tinkerpop.apache.org by "Marko A. Rodriguez (JIRA)" <ji...@apache.org> on 2017/02/16 19:43:41 UTC

[jira] [Assigned] (TINKERPOP-1614) Improve documentation for Graph.V() and Graph.E() on main docs page

     [ https://issues.apache.org/jira/browse/TINKERPOP-1614?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Marko A. Rodriguez reassigned TINKERPOP-1614:
---------------------------------------------

    Assignee: Daniel Kuppitz

> 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: Daniel Kuppitz
>
> 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)