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

• Type: Improvement
• Status: Closed
• Priority: Major
• Resolution: Done
• Fix Version/s: 3.2.5
• Component/s: documentation
• Assignee: Stephen Mallette
• Reporter: Bob Briody
• Created: 25/Jan/17 17:15
• Updated: 22/Feb/17 17:39
• Resolved: 22/Feb/17 13:55

Description

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.