Unit 8 - Algorithms

Question 1

Give 2 methods of traversing a graph.

Answer 1

• Depth first

- Breadth first

Question 2

Describe the depth-first method of traversing a graph.

Answer 2

The depth-first traversal consists of moving down the nodes from the starting node, and backtracking to get to the next node.

Question 3

Describe breadth-first traversal.

Answer 3

Breadth-first traversal method consists of exploring a vertex and its unvisited vertices, and then exploring each of these vertices are the vertices tied to each of them.