ONE 6th FORM Graph Traversal

Which of the following is not a style of graph traversal in computing?

• Breadth-First

• Depth-First

• Height-First

Graph traversal is used to find the ______ route to visit all nodes in a network

• Shortest

• Best

• Longest

• Most secure

A node in a graph traversal represents a connected component of the network

• True

• False

Nodes and vertices are two different parts of a graph traversal diagram

• True

• False

The lines/paths that connect the nodes in a graph traversal diagram are called ______

• Lines

• Edges

• Vertices

Which method of graph traversal makes use of a stack?

• Depth-First

• Breadth-First

Which method of graph traversal makes use of a queue?

• Depth-First

• Breadth-First

Which method of graph traversal continues to visit the first neighbour of each node before backtracking and beginning the next route?

• Depth-First

• Breadth-First

Which method of graph traversal visits all neighbours of one node before moving on to further nodes?

• Depth-First

• Breadth-First

Which order of traversal is correct using depth-first?

• A B C G D E F

• A B D C E C G