Basics

• Graph and representations

BFS and DFS

• BFS
• DFS
• BFS vs DFS

Cycles

• in Directed Graph
• in Undirected Graph
• Disjoint set and union-find algorithm

Shortest Path

• Dijkstra
• Bellman-Ford
• Floyd Warshall
• ...

MST(Minimum Spanning Tree)

• Prim's MST
• Kruskal's MST

Topological Sorting

• Stack
• kahn's Algorithm
• ...

Connectivity in Graph

• Biconnected Components
• SCC(Strongly Connected Components)
• Euler Circuite in a Directed Graph
• ...

Maximum Flow in Graph

• MF(Maximum Flow)
  - Ford-Fulkerson Algorithm
  - Edmonds-Karp
  - Dinic
• Maximum Bipartite Matching
  - Edmonds-Karp
  - Hopcroft-Karp