Brooks–Iyengar algorithm

Brooks–Iyengar algorithm is an algorithm which helps computers find the shortest path (the quickest way) between two points in a network, such as a map. It's like if you were trying to get from one town to another, but the roads were all scattered around, like a maze. The Brooks–Iyengar algorithm would figure out the shortest path so you get to your destination the quickest.