HomeSort by: relevance | last modified time | path
    Searched defs:strongly (Results 1 - 1 of 1) sorted by relevancy

  /src/external/mit/isl/dist/doc/
implementation.tex 1422 \subsection{Decomposing $R$ into strongly connected components}
1427 an approximation of each strongly connected components separately.
1447 strongly connected components in the graph with as vertices
1465 strongly connected components. Simply applying Tarjan's
1466 algorithm will produce topologically sorted strongly connected components.
1638 and so $R_1$ and $R_2$ form a strongly connected component.

Completed in 23 milliseconds