Find all shortest paths between sets of nodes
The SemMed graph
A set of source nodes.
A set of destination nodes.
A numeric vector of edge weights. If
find_paths relies on
igraph::all_shortest_paths to find all
shortest paths between the nodes in
function searches for undirected paths.
Because the Semantic MEDLINE graph is a multigraph, there may be multiple
paths with the same sequence of nodes. This function collapses these into
a single node sequence. The display functions (
plot_path) take care of showing the multiple edges leading to
A list of shortest paths. List items correspond to the
node(s) given in
make_edge_weights to tailor the
shortest path search
1 2 3 4 5
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.