### Chapter 22 Graphs and Applications

*22.1*A ____ is an edge that links a vertex to itself.

*22.2*If two vertices are connected by two or more edges, these edges are called ______.

*22.3*A _________ is the one in which every two pairs of vertices are connected.

*22.4*What is the number of edges in a complete graph of n vertices?

*22.5*What is the number of edges in a tree of n vertices?

*22.6*The _______ search of a graph first visits a vertex, then it recursively visits all the vertices adjacent to that vertex.

*22.7*The _______ the breadth-first search of a graph first visits a vertex, then all its adjacent vertices, then all the vertices adjacent to those vertices, and so on.

*22.8*The time complexity of the DFS algorithm is O(|E| + |V|).

*22.9*The time complexity of the BFS algorithm is O(|E| + |V|).