Graph traversal Flashcards by Abigail Hunter-Blanco

Q

Define breadth-first search

A

path with least number of nodes between two points
rows from the node
queue

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Breadth-first search algorithm

A

start node
searches through all adjacent nodes before moving on

Likes waves

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Define depth-first search

A

whether there is a path between two nodes of a graph
post order
stack

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Depth-first search algorithm

A

start node

- searches down branch of the graph

How well did you know this?

1

Not at all

2

3

4

5

Perfectly