Centralized/Decentralized Algo's
The app allows users to explore how centralized algorithms, such as Dijkstra's, find the shortest path from a starting point to other nodes in a graph. It visually demonstrates the process of evaluating paths and updating distances along the way. Additionally, users can learn about decentralized algorithms like Bellman-Ford, which shows how each node communicates with its neighbors to determine the best route. This approach provides a broader understanding of different routing methods and their uses.