This page introduces the shortest path functionality of analytics.

When starting a task you don’t always know in advance what you are looking for. Finding the shortest path between two instances in a knowledge graph can be a great way to explore connections because you do not need to provide any guidance. In the knowledge graph below I have displayed two specific people using the query:

$x has identifier "Barbara Shafner";
$y has identifier "Jacob J. Niesz";

and then searched for the shortest path(s) joining two of them using:

compute path from "id1", to "id2";

There is an easy way to do this in dashboard: simply selecting the two entities, right-click on either of them, select Shortest path, then hit Enter.

Shortest path between people

You can see below that the two people selected are married. The path query uses a scalable shortest path algorithm to determine the smallest number of relationships required to get from one concept to the other.

Shortest path between people


If you are looking for more specific connections you can of course use the subgraph functionality. In the following query only the blood relationships (parent/child relationships) are investigated and the resulting knowledge graph is shown below. We have excluded marriage in this subgraph and as a result the shortest path is longer than before - it turns out the Barbara Shafner and Jacob J. Niesz are cousins (their mothers, Mary Young and Catherine Young, are sisters, their father being Jacob Young).

compute path from "id1", to "id2", in [person, parentship];

Shortest path between people

Shortest path between people

Tags: analytics