"So it probes the whole graph globally, studying many paths at the same time." This allowed the new algorithm to solve the max-flow problem substantially faster than previous attempts.