In this section we extend the applicability of the device graph model to
complete systems. ...The problem of finding critical paths is
efficiently solvable with order (n) depth-first search (DFS)
algorithms.[#!9!#] The power triples are calculated by scanning the
vertices in ascending order and applying Eqs. (![[*]](/file/18224/World_Of_Computer_Software-02-387-Vol-3of3.iso/a/aplop.zip/APLOP.TEX/crossref.png)
)–()
to each. When the search algorithm detects that the conditions of Eq.
() are not met, it is desirable to know the critical path to the
detector so that the problem can be corrected. ...