find_edges_shortest_path: find shortest path

Description Usage Details

View source: R/utils.R

Description

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.

Usage

1

Details

This function should use an igraph based graph, and then use some of the functionality in all_shortest_paths


rmflight/STRINGDatabaseManipulation documentation built on Feb. 7, 2020, 12:26 a.m.