findPath function

Finding paths

Finds one path between two nodes of a graph.

findPath(amat, st, en, path = c())

Arguments

• 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 NULL. It should not be modified by the user.

Returns

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.

Note

This function is not intended to be directly called by the user.

References

Python Softftware Foundation (2003). Python Patterns --- Implementing Graphs. https://www.python.org/doc/essays/graphs/.

Author(s)

Giovanni M. Marchetti, translating the original Python

code (see references).

See Also

fundCycles

Examples

## A (single) path on a spanning tree
findPath(bfsearch(UG(~ a*b*c + b*d + d*e+ e*c))$tree, st=1, en=5)