This is a simple simulation of distance vector routing algorithm to understand how routing tables are updated.
- Router names are stored as characters, for the ease of understanding.
- We assume that routers are updated sequentially (0 -> n-10). You can replace router updation sequence by chaning routerUpdate().