BFS, DFS and Edge Classification
Breadth-first and depth-first search with their data structures, the order rule for neighbours, costs on adjacency lists and matrices, BFS levels and fewest-edge paths traced on six vertices, the level rule for non-tree edges; DFS discovery and finish times, the parenthesis and white-path theorems, classification of tree, back, forward and cross edges by colour and by time intervals, drawn on one DFS forest; what changes for undirected graphs; counting components from a DFS forest with the solved GATE CS 2024 Set 1 Q.60.
