The edges in a ______ indicate a direction.
A) graph
B) multigraph
C) digraph
D) spanning tree
Correct Answer:
Verified
Q14: All _ begin and end at the
Q15: A graph-traversal algorithm stops when _.
A)it first
Q16: A subset of a graph's vertices and
Q17: An iterative DFS traversal algorithm uses a(n)_.
A)list
B)array
C)queue
D)stack
Q18: An iterative BFS traversal algorithm uses a(n)_.
A)list
B)array
C)queue
D)stack
Q20: A complete graph has a(n)_ between each
Q21: A _ is a special cycle that
Q22: Adjacent vertices are joined by an edge.
Q23: A(n)_ begins at a vertex v,passes through
Q24: A connected graph has an edge between
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