Applications of Graph Search Algorithms

What is a typical application of the breadth-first search algorithm?

• Finding the shortest path for a weighted graph

• Navigating a maze

• Finding the shortest path for an unweighted graph

• Sorting a list of numbers

What is a typical application of the depth-first search algorithm?

• Finding the shortest path for an unweighted graph

• Sorting a list of numbers

• Navigating a maze

• Optimizing network flow

What is graph traversal the process of?

• Deleting each vertex in a graph

• Visiting each vertex in a graph

• Connecting each vertex in a graph

• Coloring each vertex in a graph

In depth-first graph traversal, what is fully explored before backtracking?

• A node

• An edge

• A branch

• A path

In breadth-first graph traversal, what is fully explored before moving to the next node?

• A branch

• A path

• An edge

• A node

What data structure is used in depth-first traversal?

• Queue

• Stack

• Array

• Linked List

Which of the following is a practical application of depth-first traversal?

• Navigating a maze

• Sorting a list of numbers

• Finding the shortest path

• Balancing a binary tree

Can a depth-first algorithm be performed on any type of graph?

• Yes, but only on disconnected graphs

• No, it can only be performed on trees

• Yes, but only on connected graphs

• No, it can only be performed on undirected graphs

What is a binary tree?

• A graph with undirected cycles

• A tree where each node has at most two children

• A tree with exactly two children per node

• A connected graph with no cycles

In the context of the given binary tree, which node is considered the root node?

• A

• B

• D

• F