Algorithms for Beginners / Chapter 5 — Graph traversal (lessons 15–16) / Lesson 15

Graphs and breadth-first search (BFS and Dijkstra)

🔒

Create a free account to read this lesson

Sign up for a free membership to read every lesson in our free courses. Already have an account? Please sign in.

Sign up free Sign in

‹ Previous: Heaps and priority queues (the top ten, 21x faster) Next: Depth-first search and recursion (it stops at depth 1,000) ›