Let V(G) denote the set of vertices, and E(G) denote the set of edges of a graph G, then if the elements of E are ordered pairs, G is called a directed graph or ____.
A) bigraph
B) d-graph
C) dir-graph
D) digraph
Correct Answer:
Verified
Q20: In the breadth first topological ordering, we
Q21: The breadth first traversal algorithm is similar
Q22: In the breadth first traversal algorithm, the
Q23: _ are used to model electrical circuits,
Q24: The symbol ''_'' means ''Cartesian product.''
A) *
B)
Q26: When drawing a graph, the vertices are
Q27: When drawing a graph, a _ inside
Q28: In an undirected graph, the edges are
Q29: In a directed graph, the edges are
Q30: A _ is a path in which
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents