##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Common applications
Queues appear when processing order matters:
BFS traversal: explore nodes level by level
Task scheduling: process jobs in arrival order
Buffering: handle data streams
Simulation: model real-world queues The most important application for competitive programming is BFS. When you need shortest path in an unweighted graph, BFS with a queue is the answer.
