finds one or more articulation points
nart = articul([i],g)
:a graph (see graph_data_structure).
integer
integer row vector
An articulation of a connected graph is a node whose removal will disconnect the graph. In general, an articulation vertex is a node of a graph whose removal increases the number of components.
articul
finds one or more articulation points (if
they exist) of the graph g
. nart
is the
row vector of numbers of articulation nodes: deleting one of these
nodes increases the number of connected components of the graph.
i
is the optional node number from which the
algorithm starts. The default is 1. Note that the result depends
strongly on this starting node.
Chartrand, G. "Cut-Vertices and Bridges." ยง2.4 in Introductory Graph Theory. New York: Dover, pp. 45-49, 1985.
Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.