Moved from GitHub dgraph/1494 Posted by matth3wga0 : With Neo4j, the query can be ordered by the length of the edge path, and return depth of the path in the query result, it’s useful in some scenario, such as calculating the relationship rank. In Dgraph, the depth is only a parameter in the recur…

Feature request for calculating the length of edge path

diggy (Dgraph Bot) May 31, 2019, 8:42pm 3

campoy commented :

Setting low priority since no other requests have been received regarding this issue.

Topic		Replies	Views
Why does Dgraph shortest path return more hops than Neo4j for the same data and how to get Neo4j-like paths in Dgraph? GraphQL dgraph	5	78	July 2, 2025
How to find relationship between two nodes? GraphQL	6	2614	July 3, 2020
Find paths between one node and a group of nodes Dgraph kind:question	14	2142	April 1, 2021
How to find all paths given two nodes and max length of path Dgraph	1	537	November 30, 2018
Dgraph queries the shortest path between two nodes, and queries multiple relationships through numumpths, which is inefficient Dgraph kind:question , dgraph	1	774	January 18, 2022