# Bellman-Ford algorithm in Distance Vector (DV) routing protocol

This post is a brief summary of the repo here https://github.com/jl4730/BellmanFordinDistanceVectorProtocol. The repo implemented the Bellman-Ford algorithm in the Distance Vector routing protocol. This project is very similar to the previous post about the Spanning Tree Algorithm, except that we are solving a routing problem here, not a switching problem. In this project, we will develop a **distributed **Bellman-Ford algorithm and use it to calculate routing paths in a network.