Maximum flow for all edges in an undirected graph
There is a randomized algorithm for computing Gomory-Hu tree in $\tilde{O}(|E||V|)$ time when all edges have capacity 1.
Once you have the Gomory-Hu tree, you can process it so you can answer maximum flow queries between two vertices in constant time.