22. Graphs and Applications9 Questions
Created by Y. Daniel Liang
 http://www.cs.armstrong.edu/liang/index.html
Free

A ____ is an edge that links a vertex to itself.
If two vertices are connected by two or more edges, these edges are called ______.
A _________ is the one in which every two pairs of vertices are connected.
What is the number of edges in a complete graph of n vertices?
What is the number of edges in a tree of n vertices?
The _______ search of a graph first visits a vertex, then it recursively visits all the vertices adjacent to that vertex.
The _______ the breadthfirst search of a graph first visits a vertex, then all its adjacent vertices, then all the vertices adjacent to those vertices, and so on.
The time complexity of the DFS algorithm is O(E + V).
The time complexity of the BFS algorithm is O(E + V).