(SCC) A subset, S, of the nodes of a directed graph such that any node in S is reachable from any other node in S and S is not a subset of any larger such set. SCCs are {equivalence class}es under the {transitive closure} of the "directly connected to" relation. (1995-02-06)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ arg ] [ as ] [ at ] [ b ] [ bs ] [ C ] [ ch ] [ cl ] [ class ] [ closure ] [ co ] [ con ] [ connect ] [ de ] [ directed graph ] [ du ] [ ec ] [ ed ] [ equivalence class ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fr ] [ ge ] [ gr ] [ graph ] [ h ] [ hat ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ Lex ] [ ly ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ nn ] [ no ] [ node ] [ ns ] [ om ] [ ph ] [ query ] [ rc ] [ re ] [ relation ] [ ro ] [ S ] [ SC ] [ SCC ] [ se ] [ set ] [ si ] [ sit ] [ su ] [ th ] [ to ] [ tr ] [ transitive ] [ transitive closure ] [ va ] [ ve ]