BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

Computer Science

694BFS Overview and Applications
695BFS Algorithm Structure
696BFS with Adjacency List
697BFS with Adjacency Matrix
698BFS Time and Space Complexity
699Shortest Path in Unweighted Graphs
700BFS Tree and Parent Tracking
701Level-Order Traversal
702Multi-Source BFS
703BFS for Bipartiteness Testing
704BFS in Grid Graphs
705BFS with State Space Representation
7060-1 BFS
707Bidirectional BFS
708BFS Applications and Problem Patterns
709DFS Overview and Intuition
710DFS Recursive Implementation
711DFS Iterative Implementation with Stack
712DFS Tree Edges and Classification
713Cycle Detection with DFS
714DFS on Directed vs Undirected Graphs
715DFS Discovery and Finish Times
716Path Finding with DFS
717DFS Time Complexity Analysis
718DFS Applications and Use Cases
719What is Topological Sorting?
720Topological Sort Applications
721DAG Detection and Prerequisites
722Kahn's Algorithm: Basic Idea
723Kahn's Algorithm: Implementation
724DFS-Based Topological Sort
725DFS Topological Sort: Correctness
726Detecting Cycles During Topological Sort
727Time and Space Complexity
728Multiple Valid Orderings
729Connected Components in Undirected Graphs
730Component Finding with DFS
731Component Finding with BFS
732Counting Connected Components
733Component Labeling Algorithm
734Strongly Connected Components in Directed Graphs
735Kosaraju's Algorithm for SCCs
736Applications of Connected Components

Computer Science

694BFS Overview and Applications
695BFS Algorithm Structure
696BFS with Adjacency List
697BFS with Adjacency Matrix
698BFS Time and Space Complexity
699Shortest Path in Unweighted Graphs
700BFS Tree and Parent Tracking
701Level-Order Traversal
702Multi-Source BFS
703BFS for Bipartiteness Testing
704BFS in Grid Graphs
705BFS with State Space Representation
7060-1 BFS
707Bidirectional BFS
708BFS Applications and Problem Patterns
709DFS Overview and Intuition
710DFS Recursive Implementation
711DFS Iterative Implementation with Stack
712DFS Tree Edges and Classification
713Cycle Detection with DFS
714DFS on Directed vs Undirected Graphs
715DFS Discovery and Finish Times
716Path Finding with DFS
717DFS Time Complexity Analysis
718DFS Applications and Use Cases
719What is Topological Sorting?
720Topological Sort Applications
721DAG Detection and Prerequisites
722Kahn's Algorithm: Basic Idea
723Kahn's Algorithm: Implementation
724DFS-Based Topological Sort
725DFS Topological Sort: Correctness
726Detecting Cycles During Topological Sort
727Time and Space Complexity
728Multiple Valid Orderings
729Connected Components in Undirected Graphs
730Component Finding with DFS
731Component Finding with BFS
732Counting Connected Components
733Component Labeling Algorithm
734Strongly Connected Components in Directed Graphs
735Kosaraju's Algorithm for SCCs
736Applications of Connected Components

← Computer Science

Lesson 706 of 2,872·17. Graph Traversal AlgorithmsPro lesson

0-1 BFS

Modified BFS for graphs with 0 and 1 edge weights: using deque, optimal insertion strategy, time complexity.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course