finds a circuit or the rank function in a directed graph
[p,r] = circuit(g)
row vector of integer numbers of the arcs of the circuit if it exists
row vector of rank function if there is no circuit
A cycle of a graph g
, also called a
circuit, is a subset of the edges of g
that forms
a path such that the first node of the path corresponds to the
last.
circuit
tries to find surch a circuit
for the directed graph g
. It returns the circuit
p
as a row vector of the corresponding arc numbers if
it exists and it returns the empty vector []
otherwise.
If the graph has no circuit, the rank function is returned in r
,
otherwise its value is the empty vector []
.
Stanley, R. P. Enumerative Combinatorics, Vol. 1. Cambridge, England: Cambridge University Press, 1999.