An undirected graph is a graph where the pairings representing the edges are
_____________.
D. None of the above
Two vertices in a graph are ___________ if there is an edge connecting them.
D. None of the above
An undirected graph is considered complete if it has the maximum number of
edges connecting vertices.
A. Connected
A _________ is a sequence of edges that connects two vertices in a graph.
D. Cycle
A ________ is a path in which the first and last vertices are the same and none
of the edges are repeated.
A. Connection
An undirected tree is a connected, acyclic, undirected graph with one element
designated as the _______.
A directed graph, sometimes referred as a digraph, is a graph where the edges
are _________ pairs of vertices.
D. None of the above
A path in a directed graph is a sequence of directed edges that connects two
_________ in a graph.
D. None of the above
A ________, or a weighted graph, is a graph with weights or costs associated
with each edge.
The only difference between a depth-first traversal of a graph and a breadth-first
traversal is the use of a _________ instead of a queue to manage the traversal.
D. Heap
A graph is connected if and only if the number of vertices in the __________
traversal is the same as the number of vertices in the graph regardless of the
starting vertex.
D. None of the above
A __________ tree is a tree that includes all of the vertices of a graph and some,
but possibly not all, of the edges.
A. Directed
A minimum spanning tree is a spanning tree where the sum of the weights of the
edges is ____________ to the sum of the weights for any other spanning tree for
the same graph.
D. None of the above
edges are unordered.
number of edges connecting vertices.
none of the edges are repeated.
element designated as the root.
edges are ordered pairs of vertices.
two vertices in a graph.
associated with each edge.
first traversal is the same as the number of vertices in the graph regardless of the
starting vertex.
weights of the edges is less than or equal to the sum of the weights for any other
spanning tree for the same graph.
edges are unordered.
them.
number of edges connecting vertices.
and only one of the edges are repeated.
element designated as the root.
the edges are ordered pairs of vertices.
connects two vertices in a graph.
associated with each edge.
breadth-first traversal is the use of a queue instead of a stack to manage the
traversal.
breadth-first traversal is the same as the number of vertices in the graph
regardless of the starting vertex.
and some, but possibly not all, of the vertices.
weights of the edges is greater than or equal to the sum of the weights for any
other spanning tree for the same graph.
What is the difference between a graph and a tree?
A graph is the more general concept without the restriction that each
What is an undirected graph?
What is a directed graph?
What does it mean to say that a graph is complete?
What is the maximum number of edges for an undirected graph? A directed
What is the definition of path? Of cycle?
What is the difference between a network and a graph?
What is a spanning tree? A minimum spanning tree?