libgraph v0.1.0 Graph.Pathing
This module contains implementation code for path finding algorithms used by libgraph.
Link to this section Summary
Functions
Finds all paths between a and b, each path as a list of vertices.
Returns nil if no path can be found
Finds the shortest path between a and b as a list of vertices.
Returns nil if no path can be found
Link to this section Functions
Link to this function
all(g, a, b)
Finds all paths between a and b, each path as a list of vertices.
Returns nil if no path can be found.
Link to this function
shortest_path(g, a, b)
Finds the shortest path between a and b as a list of vertices.
Returns nil if no path can be found.