In Link-state routing protocol Dijkstra's algorithm is used. In Distance-vector routing protocol Bellman-Ford algorithm is used. My question is why we use two different algorithm. Why not only one algorithm?
Dijkstra's Algorithm can't work on negative edge, but in routing there can't be any negative edge. OK but in matter of debate let's say there can be any negative edge in case of malfunctioning. Then why not use Bellman-Ford in both protocol?