A directed graph, sometimes referred as a digraph, is a graph where the edges are _________ pairs of vertices.
A) Unordered
B) Ordered
C) Sorted
D) None of the above

Name: A directed graph, sometimes referred as a digraph, is a graph where the edges are _________ pairs of vertices. A) Unordered B) Ordered C) Sorted D) None of the above
Brand: Quizplus
Rating: 4.9 (42 reviews)

Question

Quizplus · Accepted Answer

In a directed graph (digraph), the edges are ordered pairs of vertices, indicating a direction from one vertex to another.

A Directed Graph, Sometimes Referred as a Digraph, Is a Graph