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

Given that data, I get the expected results…