Graph Traversals

Which of the following are types of graph traversal in computing? (PICK 2)

• Breadth-First

• Depth-First

• Height-First

• Adjacent-First

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

• Shortest

• Best

• Longest

• Most secure

In graphs, nodes and vertices are two different things.

• True

• False

The lines or paths that connect the nodes in a graph are called? (PICK 2)

• Lines

• Edges

• Vertices

• Arcs

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

• Depth-First

• Breadth-First

Which graph traversal method visits all neighbors of a node before moving on to further nodes?

• Depth-First

• Breadth-First

Select all the example uses of depth-first traversal. (PICK 3)

• Job Scheduling

• Puzzles with only one solution

• Data flow within a network

• Simulating the spread of a disease/virus

Select all the example uses of breadth-first traversal. (PICK 3)

• Simulating the spread of a disease or virus

• Web crawlers or spiders

• Suggested friend system on social media

• Puzzles with only one solution

Which order of traversal is correct using depth-first?

• A B C G D E F

• A B D C E C G

Which order of traversal is correct using breadth-first?

• A B D E C F G

• A B C G D E F