In a nutshell
Distance-vector routing finds best paths without any router seeing the whole network. Each one keeps its lowest known cost to every destination and periodically shares that vector with its direct neighbours. Each router folds in its neighbours' figures to improve its own, until the tables stop changing — they've converged.