Introduction

• BFS (Breath First Search) can be used to traverse or search in data structure
• For example,
  • BFS can be used to find the shortest path, from a start node to a target node
  • BFS can traverse all the possible statuses
• Queue can help to implement a BFS based algorithm

You Will Know

• topic1

Why Should You Learn These

Contents

Click cmd/ctrl + option/alt + T to expand all toggles

1. Queue and BFS — The Shortest Path

2. General Problems

Conclusions

References

• link1

Further Readings

• a further reading for topic 1

Note