代码之家 › 专栏 › 技术社区 › Jeff

我们如何得到2个顶点的路径?

janusgraph gremlin

Jeff · 技术社区 · 7 年前

现在我有了下面的查询,我想得到所有的边缘,这很有趣,为什么我们得到了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]]

1 回复 | 直到 7 年前

stephen mallette 7 年前

您只需通过明确遍历边来指定也需要这些边:

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]]

推荐文章

FARSOS BULSARA · 按源节点gremlin筛选节点

6 年前

Jeremy · 如何序列化rest服务的Tinkerpop顶点/边列表?[嵌入式JanusGraph]

6 年前

janus graph · 如果里面有其他东西,那就是小精灵。by()函数

6 年前

juwuba · 如何将禁用的混合索引更新为启用的?

6 年前

James Baker · 通过Java配置JanusGraph以使用Lucene

6 年前

Jeff · JanusGraph函数cyclicPath()

6 年前

Augusto Will · 小精灵:我如何返回顶点及其关联顶点?

6 年前

takaomag · JanusGraph索引仅用于查找条目元素?

6 年前

BigBug · 带Solr的JanusGraph

6 年前

trojek · JanusGraph构建失败(TinkerPop 3.2.4)

6 年前