Graph Traversal

Front

Which of the following is not a style of graph traversal in computing? Breadth-First, Depth-First, Height-First

Back

Height-First

Front

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

Back

Shortest

Front

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

Back

True

Front

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

Back

False

Front

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

Back

Edges

Front

Which method of graph traversal makes use of a stack?

Back

Depth-First

Front

Which method of graph traversal makes use of a queue?

Back

Breadth-First

Front

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

Back

Depth-First

Front

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

Back

Breadth-First

Front

Which order of traversal is correct using depth-first? Options: A B C G D E F, A B D C E C G

Back

A B C G D E F