Exam 13: Sets and Maps

A network, or a weighted graph, is a graph with weights or costs associated with each edge.

A ________, or a weighted graph, is a graph with weights or costs associated with each edge.

What does it mean to say that a graph is complete?

A _________ is a sequence of edges that connects two vertices in a graph.

A graph is ______ if and only if the number of vertices in the breadth-first traversal is the same as the number of vertices in the graph regardless of the starting vertex.

What is the maximum number of edges for an undirected graph? A directed graph?

What is a directed graph?

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

Two vertices in a graph are ___________ if there is an edge connecting them.

An undirected graph is a graph where the pairings representing the edges are unordered.

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

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.

The only difference between a depth-first traversal of a graph and a breadth-first traversal is the use of a stack instead of a ______ to manage the traversal.

A minimum spanning tree is a spanning tree where the sum of the weights of the edges is greater than or equal to the sum of the weights for any other spanning tree for the same graph.

An undirected graph is a graph where the pairings representing the edges are _____________.

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.

What is the difference between a graph and a tree?

A graph is connected if and only if the number of vertices in the breadth-first traversal is the same as the number of vertices in the graph regardless of the starting vertex.

A directed graph, sometimes referred as a digraph, is a graph where the edges are ordered pairs of vertices.

The only difference between a depth-first traversal of a graph and a breadth-first traversal is the use of a queue instead of a stack to manage the traversal.