Next:
Graph Algorithms
Labelled Graphs
Representation
2. Adjacency matrix
Traversing Graphs
Breadth-First Search (BFS)
BFS Data Structures
Pseudocode
Examples
Analysis
Properties
Predecessor Subgraph
Depth-First Search
DFS
Examples
Topological Sort
Pseudocode
Example: Professor Bumstead gets dressed
Strongly Connected Components
Pseudocode
Example
Applications
Next: