Search⌘ K
AI Features

Feature #9: Update Configuration

Explore how to model and solve the configuration update propagation in a network of interconnected routers arranged in a grid. Learn to apply Breadth-First Search to simulate control message flow and calculate the minimum minutes needed for all routers to update their configuration.

Description

We have a network topology in which several network routers are interconnected in a rectangular grid. A router has four neighboring routers: up, right, left,up,\ right,\ left, and downdown. A router transmits a configuration update control message to its 4 directionally adjacent neighbors in response to a configuration change. The routers exchange control messages with their adjacent neighbors at one-minute intervals.

A router accepts the configuration change only if it receives a configuration update from its four neighbors, ...