SOLVED

11)A ______ can have duplicate edges between vertices. a)spanning tree b)connected graph c)complete graph d)multigraph 12)A self edge is also called a ______. a)cycle b)loop c)circuit d)multigraph 13)The ______ of a weighted graph have numeric labels. a)vertices b)edges c)paths d)cycles 14)The edges in a ______ indicate a direction. a)graph b)multigraph c)digraph d)spanning tree 15)If there is a directed edge from vertex x to vertex y, which of the following can be concluded about x and y? a)y is a predecessor of x b)x is a successor of y c)x is adjacent to y d)y is adjacent to x 16)A graph-traversal algorithm stops when ______. a)it first encounters the designated destination vertex b)it has visited all the vertices that it can reach c)it has visited all the vertices d)it has visited all the vertices and has returned to the vertex that it started from 17)A ______ is the subset of vertices visited during a traversal that begins at a given vertex. a)circuit b)multigraph c)digraph d)connected component 18)An iterative DFS traversal algorithm uses a(n) ______. a)list b)array c)queue d)stack 19)An iterative BFS traversal algorithm uses a(n) ______. a)list b)array c)queue d)stack 20)A ______ order is a list of vertices in a directed graph without cycles such that vertex x precedes vertex y if there is a directed edge from x to y in the graph. a)graphical b)topological c)hierarchal d)spatial