Finding paths
Finds one path between two nodes of a graph.
findPath(amat, st, en, path = c())
amat |
a square Boolean matrix with dimnames, the adjacency matrix of a graph. |
st |
an integer, the starting node. |
en |
an integer, the ending node. |
path |
a vector of integers, used in recursive calls. At the
beginning is |
a vector of integers, the sequence of nodes of a path,
starting from st to en. In some graphs
(spanning trees) there is only one path between two nodes.
This function is not intended to be directly called by the user.
Giovanni M. Marchetti, translating the original Python code (see references).
Python Softftware Foundation (2003). Python Patterns — Implementing Graphs. http://www.python.org/doc/essays/graphs/.
## A (single) path on a spanning tree findPath(bfsearch(UG(~ a*b*c + b*d + d*e+ e*c))$tree, st=1, en=5)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.