Multiple Choice
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
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q1: A path in a directed graph is
Q2: Two vertices in a graph are adjacent
Q3: Two vertices in a graph are adjacent
Q4: An undirected tree is a connected, _,
Q5: A _ is a path in which
Q7: An undirected graph is considered complete if
Q8: An undirected graph is considered complete if
Q9: A _ is a sequence of edges
Q10: A _, or a weighted graph, is
Q11: A cycle is a path in which