Week 07
Graph Traversal
Graph Traversal
Depth-first Traversal
Ex1: Depth-first Traversal
DFS Examples
Checking for Cycles
Ex2: Buggy Cycle Check
Connected Components
Breadth-first Search
Ex3: Breadth-first Traversal
Ex4: BFS Visiting Order
Paths: Simple, Hamilton, Euler
Simple Paths
Path Finding
Hamilton Path and Tour
Hamilton Path and Tour
Euler Path and Tour
Ex5: Vertex Degrees
Connected Components
Ex6: Connectedness Checks
Ex7: Implementing Component Array
Directed Graphs (Digraphs)
Directed Graphs (Digraphs)
Digraph Applications
Digraph Representation
PageRank
Ex8: Estimate the size of the Web
Ex9: Checking inbound links
Produced: 6 Sep 2017