finds the nodes that make a shortest path between two given sets of nodes and a distance paramter. This is done by breaking any edges between the sets of nodes provided, and then asking for the shortest path from a node in one set to the nodes in the other set, trimming to those that are within a specific number of hops.
1 |
This function should use an igraph based graph, and then use some of the functionality in all_shortest_paths
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.