我們如何獲得2個頂點路徑？

Question

現在我有下面的查詢，我想得到所有的邊緣，這很有趣，爲什麼我們有2個相同的路徑，我想獲得路徑的細節。我該如何執行？

Vertex fromNode = g.V().has('name', 'alice').next();Vertex toNode = g.V().has('name', 'bobby').next();g.V(fromNode).repeat(both().simplePath()).until(is(toNode)).path() ==>[v[4224],v[40964296]] ==>[v[4224],v[40964296]] ==>[v[4224],v[4144],v[40964256],v[4096],v[40964296]]

我們有下面的圖表。

gremlin> a = graph.addVertex("name", "alice") 
==>v[4208] 
gremlin> b = graph.addVertex("name", "bobby") 
==>v[40968424] 
gremlin> c = graph.addVertex("name", "cindy") 
==>v[4192] 
gremlin> d = graph.addVertex("name", "david") 
==>v[40972520] 
gremlin> e = graph.addVertex("name", "eliza") 
==>v[40964272] 
gremlin> a.addEdge("rates",b,"tag","ruby","value",9) 
==>e[2ry-38w-azv9-oe3fs][4208-rates->40968424] 
gremlin> b.addEdge("rates",c,"tag","ruby","value",8) 
==>e[odzq5-oe3fs-azv9-38g][40968424-rates->4192] 
gremlin> c.addEdge("rates",d,"tag","ruby","value",7) 
==>e[170-38g-azv9-oe6lk][4192-rates->40972520] 
gremlin> d.addEdge("rates",e,"tag","ruby","value",6) 
==>e[oe04d-oe6lk-azv9-oe08g][40972520-rates->40964272] 
gremlin> a.addEdge("rates",e,"tag","java","value",9) 
==>e[366-38w-azv9-oe08g][4208-rates->40964272] 
gremlin> g.E().values("tag") 
==>ruby 
==>ruby 
==>ruby 
==>ruby 
==>java 
gremlin> graph.tx().commit() 

我想獲得的路徑細節如下圖所示：

==>bobby=[v[0], e[10][0-rates->2], v[2]] 
==>cindy=[v[0], e[10][0-rates->2], v[2], e[11][2-rates->4], v[4]] 
==>david=[v[0], e[10][0-rates->2], v[2], e[11][2-rates->4], v[4], e[12][4-rates->6], v[6]] 

Answer 1

你只需要指定通過遍歷在他們明確你想要的邊緣還有：

gremlin> g.V(fromNode).repeat(bothE().otherV().simplePath()).until(is(toNode)).path() 
==>[v[0],e[10][0-rates->2],v[2]] 
==>[v[0],e[14][0-rates->8],v[8],e[13][6-rates->8],v[6],e[12][4-rates->6],v[4],e[11][2-rates->4],v[2]]