Search: Shortest path
Linkurious provides an option to find the shortest past between two nodes in our graph. Here, we will be looking for the connections between the companies Facebook and LinkedIn.
We start with 2 seemingly disconnected nodes,
Find. Next we choose
Now we choose the
starting node (LinkedIn) and the
We click on
Find shortest paths. The results are now displayed.
We can choose
Add all to view all the results or choose our preferred
path by clicking on it.
Our choice is added to the visualization.