Let G be a directed graph and V(G) = {v₁, v₂, . . ., v_n}, where n = 0. A(n) ____ of V(G) is a linear ordering v_i₁, v_i₂, . . ., v_in of the vertices such that, if v_ij is a predecessor of v_ik, j does not equal k, 1

Question

Let G be a directed graph and V(G) = {v₁, v₂, . . ., v_n}, where n >= 0. A(n) ____ of V(G) is a linear ordering v_i₁, v_i₂, . . ., v_in of the vertices such that, if v_ij is a predecessor of v_ik, j does not equal k, 1 <= j <= n, 1 <= k <= n, then v_ij precedes v_ik, that is, j < k in this linear ordering. A) ontological ordering B) orthogonal ordering C) topological ordering D) typographical ordering

Quizplus · Accepted Answer

The correct term is "topological ordering," which refers to a linear ordering of the vertices of a directed graph such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. This is consistent with the definition provided in the question.

Let G Be a Directed Graph and V(G) = {V1

Let G Be a Directed Graph and V(G) = {V₁