I’m working on a project where I need to find the route between two nodes. So I’m wondering is dgraph a good solution? And if it is how would you do that? Lets say I have the data below. I’d like to only show the “route” leading to test5. { set { _:1 <name> "test1" . _:1 <next> _:2 . …

Hi there, Victor. It sounds like a K Shortest Path Query might suit your needs. A as var(func: eq(name, "test1")) # Obtain uid of your starting node B as var(func: eq(name, "test5")) # Obtain uid of your ending node path as shortest(from: uid(A), to: uid(B)) { next # Specifying the predicate(s…

Finding path to node

Users

system (system) Closed January 26, 2020, 7:18am 4

This topic was automatically closed 30 days after the last reply. New replies are no longer allowed.

Topic		Replies	Views
Shortest Path Queries - Query language Documentation	10	1194	November 18, 2021
Path existence (NOT shortest path) Dgraph	1	1212	November 5, 2018
How to find all paths given two nodes and max length of path Dgraph	1	537	November 30, 2018
Shortest path query problem Dgraph kind:question	5	1235	October 12, 2020
Find paths between one node and a group of nodes Dgraph kind:question	14	2142	April 1, 2021

Finding path to node

Related topics