CSC270 Lecture Outlines - February
January's notes
February 2 - C
[ King 11, 12, 17 ]
February 4 - Graphs
[ course notes 9.1, 9.2, 9.3 ]
- lecture notes in Engineering Library
- Introduction, motivation
- Adjacency matrix representation
- Adjacency list representation
February 6 - C for graphs
[ King 12, 17 ]
February 9 - Single-source Shortest Paths
[ course notes 9.8 ]
- lecture notes in Engineering Library
- Single-source shortest paths
- relaxing an edge
- Dijkstra's algorithm
February 11 - Midterm
February 13 - All-Pairs Shortest Paths
[ course notes 9.9 ]
- lecture notes in Engineering Library
- All-pairs shortest paths
- Floyd's algorithm
February 16-20 - Reading Week
February 23 - Graph Searching
[ course notes 9.6 for DFS ]
- lecture notes in Engineering Library
- Breadth-first search (BFS)
- Depth-first search (DFS)
February 25 - Graphs and C++
[ course notes 9.6 for DFS ]
[ King 19.3, 19.4 for C++ ]
February 27 - Graphs
March's notes