Let G be a directed graph and V(G) = {v1, v2, . . ., vn}, where n >= 0. A(n) ____ of V(G) is a linear ordering vi1, vi2, . . ., vin of the vertices such that, if vij is a predecessor of vik, j does not equal k, 1 <= j <= n, 1 <= k <= n, then vij precedes vik, that is, j < k in this linear ordering.
A. ontological ordering
B. orthogonal ordering
C. topological ordering
D. typographical ordering
Answer: C
Computer Science & Information Technology
You might also like to view...
In a ________ relationship, a junction table must be created
A) one-to-many B) many-to-many C) one-to-one D) many-to-one
Computer Science & Information Technology
When an organization has a properly implemented enterprise risk management (ERM), what is the tool used to list and categorize each discovered or encountered risk?
A. Cost/benefit equation B. Delphi technique C. Risk register D. Threat model
Computer Science & Information Technology