Chapter 29

Question 1

What is path finding algorithm

Answer 1

Algorithm that uses on graph for finding shortest path

Question 2

What is fully connected graph

Answer 2

Each vertex is connected to its possible vertex

Question 3

What is breadth-first search

Answer 3

Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root and explores the neighbor nodes first, before moving to the next level neighbors.

Question 4

What are adjacent node

Answer 4

The node which are directly connected to a node

Question 5

What is adjancy list

Answer 5

It helps to find neighbors of neighbors

Question 6

What is wave front

Answer 6

A hypothetical circle of first level adjacent nodes is called first wave front.

Question 7

What is depth-first search

Answer 7

Depth First Search (DFS) The DFS algorithm is a recursive algorithm that uses the idea of backtracking but it can also non-recursive. Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root and explores as far as possible along each branch before backtracking.

Question 8

What is meaning of traversing a graph

Answer 8

Traversing a graph means visiting every node in graph

Question 9

What is bag

Answer 9

Generic graph traversal algorithm stores a set of candidates edges in data structure called bag. It is data structure like stack and queue.