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