A path in a directed graph is a sequence of directed edges that connects two _________ in a graph.
A) Vertices
B) Trees
C) Edges
D) None of the above

Name: A path in a directed graph is a sequence of directed edges that connects two _________ in a graph. A) Vertices B) Trees C) Edges D) None of the above
Brand: Quizplus
Rating: 4.8 (30 reviews)

Question

Quizplus · Accepted Answer

A path in a directed graph is defined by a sequence of directed edges that connects two vertices.

A Path in a Directed Graph Is a Sequence of Directed