Week 06, Thursday
Validity Checking
Adjacency Matrix Representation
Ex1: Checking Neighbours (ii)
Ex2: Getting Neighbours (ii)
Adjacency List Representation
Ex3: Checking Neighbours (iii)
Ex4: Getting Neighbours (iii)
Ex5: Adjacency List Storage
Comparison of Graph Representations
Graph Algorithms
Problems on Graphs
An Aside: Complexity Classes
Graph Algorithms
Finding a Path
Ex6: BFS
isPath()
Function
Ex7: Breadth-first Traversal
Ex8: Depth-first Traversal
Ex9: Finding Neighbours
Ex10: Implement GraphLab
Graph Traversal
Graph Traversal
Depth-first Traversal
Produced: 3 Sep 2015
![[index]](icon/up.gif){kind=icon}