From Reachability Matrix to Hierarchical Matrix: Difference between revisions
Jump to navigation
Jump to search
(Created page with "The '''Hierarchical Reachability Matrix''' is constructed in order to partition the element set into levels. ==== Process ==== # Two subsets of the element set are construct...") |
No edit summary |
||
| Line 3: | Line 3: | ||
==== Process ==== | ==== Process ==== | ||
# Two subsets of the element set are constructed for each element e<sub>i</sub>: | # Two subsets of the element set are constructed for each element e<sub>i</sub>: | ||
* The reachability set R<sub>i</sub> which involves all of those elements that are reachable from element e<sub>i</sub> | |||
* An antecedent set A<sub>i</sub> which involves all of those elements that reach element e<sub>i</sub>. | |||
In other words for each element e<sub>i</sub> the set R<sub>i</sub> can be determined as the set of elements whose columns have an entry of 1 in row i of the Reachability Matrix. | In other words for each element e<sub>i</sub> the set R<sub>i</sub> can be determined as the set of elements whose columns have an entry of 1 in row i of the Reachability Matrix. | ||
Revision as of 14:10, 7 January 2022
The Hierarchical Reachability Matrix is constructed in order to partition the element set into levels.
Process
- Two subsets of the element set are constructed for each element ei:
- The reachability set Ri which involves all of those elements that are reachable from element ei
- An antecedent set Ai which involves all of those elements that reach element ei.
In other words for each element ei the set Ri can be determined as the set of elements whose columns have an entry of 1 in row i of the Reachability Matrix.