$graph
$graph :
Cycle analyses cycles by searching for strongly connected components
Tarjan is a decorator of Graph for finding strongly connected components in a directed graph (a.k.a digraph)
getStronglyConnected() : array
Get the strongly connected components of this digraph by the Tarjan algorithm.
Starting from : http://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
Corrected with the help : https://code.google.com/p/jbpt/source/browse/trunk/jbpt-core/src/main/java/org/jbpt/algo/graph/StronglyConnectedComponents.java
the partition of this graph : an array of an array of vertices
__construct(\Trismegiste\Mondrian\Graph\Graph $g)
Decorates the graph
| \Trismegiste\Mondrian\Graph\Graph | $g |
addEdge(\Trismegiste\Mondrian\Graph\Vertex $source, \Trismegiste\Mondrian\Graph\Vertex $target)
Add a (un)directed edge if it does not already exist
| \Trismegiste\Mondrian\Graph\Vertex | $source | |
| \Trismegiste\Mondrian\Graph\Vertex | $target |
addVertex(\Trismegiste\Mondrian\Graph\Vertex $v)
Add a vertex to the graph without edge
| \Trismegiste\Mondrian\Graph\Vertex | $v |
searchEdge(\Trismegiste\Mondrian\Graph\Vertex $source, \Trismegiste\Mondrian\Graph\Vertex $target) : \Trismegiste\Mondrian\Graph\Edge
Searches an existing (directed or not) edge between two vertices
| \Trismegiste\Mondrian\Graph\Vertex | $source | |
| \Trismegiste\Mondrian\Graph\Vertex | $target |
getSuccessor(\Trismegiste\Mondrian\Graph\Vertex $v) : null|array
Get successors of a vertex
| \Trismegiste\Mondrian\Graph\Vertex | $v |
null if the vertex is not in this graph
or an array of verticesgetEdgeIterator(\Trismegiste\Mondrian\Graph\Vertex $v) : \Trismegiste\Mondrian\Graph\Iterator
Get an iterator on edges for one vertex
| \Trismegiste\Mondrian\Graph\Vertex | $v |
recursivStrongConnect(\Trismegiste\Mondrian\Graph\Vertex $v)
| \Trismegiste\Mondrian\Graph\Vertex | $v |