1. In an adjacency list representation, corresponding to each vertex v is a linked list such that each node of the linked list contains the vertex u, and (v, u) ∈ E(G). 2. The depth first traversal of...

1. In an adjacency list representation, corresponding to each vertex v is a linked list such that each node of the linked list contains the vertex u, and (v, u) ∈ E(G).

2. The depth first traversal of a graph is similar to the preorder traversal of a binary tree.

3. The breadth first traversal of a graph is similar to the level-by-level traversal of a binary tree.