fundCycles {ggm} | R Documentation |
Finds the list of fundamental cycles of a connected undirected graph.
fundCycles(gmat)
gmat |
a symmetric matrix with dimnames denoting the edge matrix of the undirected graph. The graph must be connected, otherwise the function returns an error message. |
All the cycles in an UG can be obtained from combination (ring sum) of the set of fundamental cycles.
a list of matrices with two columns. Every component of the list
is associated to a cycle. The cycle is described by a
k times 2 matrix whose rows are the edges of the cycle. If
there is no cycle the function returns NULL
.
This function is used by cycleMatrix
and is.Gident
.
Giovanni M. Marchetti
Thulasiraman, K. & Swamy, M.N.S. (1992). Graphs: theory and algorithms. New York: Wiley.
UG
,findPath
,
cycleMatrix
, is.Gident
,bfs
## One cycle cycleMatrix(UG(~a*b*d + d*e + e*a*f)) ## Three fundamental cycles fundCycles(UG(~a*b*d + d*e + e*a*f)) ## No cycles cycleMatrix(UG(~a*b + b*d + d*e))