Méthode | Description | |
---|---|---|
getStronglyConnected ( ) : array | Get the strongly connected components of this digraph by the Tarjan algorithm. |
Méthode | Description | |
---|---|---|
recursivStrongConnect ( |
public getStronglyConnected ( ) : array | ||
Résultat | array | the partition of this graph : an array of an array of vertices |