ggm (version 2.2)

findPath: Finding paths

Description

Finds one path between two nodes of a graph.

Usage

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.

Value

• 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.

References

Python Softftware Foundation (2003). Python Patterns --- Implementing Graphs. http://www.python.org/docs/essays/graphs.html.

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)