Why does Dgraph shortest path return more hops than Neo4j for the same data and how to get Neo4j-like paths in Dgraph?

Users GraphQL
2

Hey @janakmistry Guessing it has to something to do with the differences in edge types. Any chance I could get access to the data, can you export?