CSE 202: Algorithm Design and Analysis -- Syllabus

• Basic Graph Algorithms
  • BFS
  • DFS
  • Minimum Spanning Tree
    • Kruskal
    • Prim
  • Multi-Terminal Shortest Path (Floyd Warshall)
• Dynamic Programming
  • Knapsack
    • With Fractional x_i
    • With Integer x_i
    • Gain
  • Sequence Partitioning
• Trees
  • Huffman Tree (items in a set)
  • Hu-Tucker Tree (items in a sequence)
• Flow
  • Ford Fulkerson (max flow min cut, single source/dest)
  • Gomory Hu (max flow/min cut, multi terminal)