Navigation
Name
Rascal
/
Libraries
/
analysis
/
graphs
/
Graph
/
shortestPathPair
Synopsis
Determine the shortest path between two graph nodes.
Function
list[&T] shortestPathPair(Graph[&T] G, &T From, &T To)
Usage
import analysis::graphs::Graph;
Description
Returns the shortest path between nodes
From
and
To
in Graph
G
.
[
Edit
] | [
New Subconcept
] | [
Recompile Course
] | [
Warnings
]
Is this page unclear, or have you spotted an error? Please add a comment below and help us to improve it. For all other questions and remarks, visit
ask.rascal-mpl.org
.