PHP 클래스 Trismegiste\Mondrian\Graph\Tarjan

Tarjan is a decorator of Graph for finding strongly connected components in a directed graph (a.k.a digraph)

상속: extends Algorithm

공개 메소드들

메소드	설명
getStronglyConnected ( ) : array	Get the strongly connected components of this digraph by the Tarjan algorithm.

비공개 메소드들

메소드	설명
recursivStrongConnect ( Vertex $v )

메소드 상세

getStronglyConnected() 공개 메소드

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

public getStronglyConnected ( ) : array
리턴	array	the partition of this graph : an array of an array of vertices