path
Find how two entities are connected, as a chain of intermediate entities and facts.
Over the portable facade this returns at most a single shortest path; the (N) count in the output is therefore 0 or 1. A native graph adapter may enumerate multiple paths, in which case the same formatting renders them all.
Return
human-readable path(s), or graceful text when no path exists
Parameters
entity
opaque identifier of the start entity
entity
opaque identifier of the end entity