Deque
A double-ended queue backed by Rust’s VecDeque.
This is very useful for implementing algorithms like BFS.
let queue = Deque();
queue.push_back((0, 0));
while not queue.is_empty() {
let cur = queue.pop_front();
// etc.
}
Press ← or → to navigate between chapters
Press S or / to search in the book
Press ? to show this help
Press Esc to hide this help