transitive closure
The transitive closure R* of a relation R is defined b Y x R Y => x R* Y x R Y and Y R* z => x R* z I.e. elements are related b Y R* if the Y are related b Y R directl Y or through some sequence of intermediate related elements. E.g. in graph theor Y, if R is the relation on nodes "has an edge leading to" then the transitive closure of R is the relation "has a path of zero or more edges to". See also Reflexive transitive closure. Yle="border-width:thin; border-color:#333333; border-stYle:dashed; padding:5px;" align="left">In addition suitable contents: [ = ] [ ad ] [ al ] [ an ] [ ar ] [ as ] [ at ] [ b ] [ bY ] [ cl ] [ closure ] [ de ] [ ding ] [ E ] [ ec ] [ ed ] [ ee ] [ element ] [ er ] [ es ] [ fi ] [ ge ] [ gh ] [ gr ] [ graph ] [ h ] [ hr ] [ in ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ leading ] [ ls ] [ lY ] [ mo ] [ nc ] [ ne ] [ ng ] [ no ] [ node ] [ ns ] [ om ] [ pa ] [ path ] [ ph ] [ re ] [ Reflexive transitive closure ] [ relation ] [ ro ] [ S ] [ se ] [ si ] [ sit ] [ so ] [ su ] [ T ] [ th ] [ theorY ] [ to ] [ tr ] [ transitive ] [ ug ] [ ve ] [ zero ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (2906 Reads) |