C
C
CS61B Textbook
Search…
⌃K
Contributors
DISCLAIMER
1. Introduction
9. Extends, Casting, Higher Order Functions
11. Subtype Polymorphism, Comparators, Comparable
12. Exceptions, Iterators, Object Methods
13. Asymptotics I
14. Disjoint Sets
15. Asymptotics II
16. ADTs and BSTs
17. B-Trees
18. Red Black Trees
19. Hashing I
20. Hashing II
21. Heaps and Priority Queues
22. Tree Traversals and Graphs
23. Graph Traversals and Implementations
23.1 BFS & DFS
23.2 Representing Graphs
23.3 Summary
23.4 Exercises
24. Shortest Paths
25. Minimum Spanning Trees
26. Prefix Operations and Tries
27. Software Engineering I
28. Reductions and Decomposition
Powered By
GitBook
23. Graph Traversals and Implementations
By William Lee and Mihir Mirchandani
Here are the articles in this section:
23.1 BFS & DFS
23.2 Representing Graphs
23.3 Summary
23.4 Exercises
Previous
22.4 Graph Problems
Next
23.1 BFS & DFS
Last modified
14d ago