Lecture 1
- Big O Notation
- Algorithm Analysis
- Max Substring Sum
Lecture 2
- Graphs
- Undirected Graphs
- Directed Graphs
- Adjacency Matrix
- Adjacency List
- DFS (Depth First Search)
- BFS (Breadth First Search)
Lecture 3
- DFS in DAG
- Classification of Edges
- Topologically Sort DAG
- Classification of Vertices
- Arbitrarily Directed Graph
Lecture 4
- General directed graphs
- SCC Algorithm
- Metagraph on SCC’s
Lecture 5
Lecture 6
- Min-Heap
- D-Ary Tree
- Bellman-Ford
Lecture 7
- Minimum spanning tree
- Prim’s Algorithm
- Krushkal’s Algorithm
- Cut Property
Lecture 8
Lecture 9