Groups
Category
Level
SPFA is a queue-based optimization of Bellman–Ford that only relaxes edges from vertices whose distance just improved.
0-1 BFS is a shortest path algorithm specialized for graphs whose edge weights are only 0 or 1.
Sliding window is a technique that moves a contiguous segment (window) across an array or string while maintaining some running information like sum, count, or max.