Lines Matching +full:sub +full:- +full:nodes
45 all edges in the graph go from higher numbered nodes to lower
46 numbered nodes.
48 If we propagate time from nodes in the
63 Let $C sub e$ be the number of calls to some routine,
64 $e$, and $C sub e sup r$ be the number of
69 $C sub e sup r / C sub e$
71 Let the $S sub e$ be the $selftime$ of a routine, $e$.
74 The total time, $T sub r$, we wish to account to a routine
77 T sub r ~ = ~ {S sub r} ~ + ~
79 {T sub e times {{C sub e sup r} over {C sub e}}}
88 In these cases, we discover strongly-connected
92 We use a variation of Tarjan's strongly-connected
94 that discovers strongly-connected components as it is assigning
99 For example, a self-recursive routine
127 in which the nodes labelled 3 and 7 in Figure 1 are mutually
169 and which is in language-independent form.