Distance Vector Routing Table is a data structure used in computer networks to store information about the distances to different destinations on the network. It is used by distance-vector routing protocols, such as RIP and IGRP, to calculate the best path to each destination.
The table is typically implemented as a two-dimensional array, with the rows representing the different destinations and the columns representing the different possible paths to each destination. Each entry in the table contains the distance to the destination along the corresponding path.