Concepts5

P vs NP asks whether every problem whose solutions can be verified quickly can also be solved quickly.

Dinic's algorithm computes maximum flow by repeatedly building a level graph with BFS and sending a blocking flow using DFS.

Tree diameter is the longest simple path in a tree and can be found with two BFS/DFS runs.

Breadth-First Search (BFS) explores a graph level by level, visiting all vertices at distance d from the source before any at distance d+1.

A queue is a First-In-First-Out (FIFO) line where you add at the back and remove from the front in O(1) time.