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

That dataset is missing person1. Also, assuming this is your schema

<CONNECTED>: [uid] @reverse .
<OWNER>: uid @reverse .
<nt>: string @index(exact) .
<title>: string @index(exact) .
type <Entity> {
	title
	nt
	CONNECTED
	OWNER
}
type <Function> {
	title
	nt
	CONNECTED
	OWNER
}
type <Functional_Role> {
	title
	nt
	CONNECTED
	OWNER
}
type <Office_Location> {
	title
	nt
	CONNECTED
	OWNER
}
type <People> {
	title
	nt
	CONNECTED
	OWNER
}