Exam 20: Graph Algorithms

Graph theory started in 1736 with the ____ problem.

A graph might have cycles; therefore, we might not be able to traverse the entire graph from a single vertex.

The implementation of a breadth first graph traversal uses a stack.

Let G be an undirected graph.Let u and v be two vertices in G.A(n) ____________________ in G is a simple path in which the first and last vertices are the same.

A set Y is called a(n) ____________________ of X if every element of Y is also an element of X.

A graph is ____________________ if the number of vertices is zero.

The shortest path is the path with the smallest ____.

If the elements of E(G) are ordered pairs, G is called a(n) ____ graph.