With Bellman-Ford visualizer, you can move step-by-step through each step of the Bellman-Ford algorithm visually to find shortest paths to all other vertices from a single source vertex.
The Bellman-Ford algorithm computes shortest paths from a single source vertex to every other vertex in a weighted (,and in our case, directed) graph. Unlike the more popular Djikstra's algorithm, this algorithm is capable of finding shortest paths even in graphs with negative edge weights (but no negative weight cycles). The main idea is that the maximum length of the shortest path to any other vertex can be no more than |V| - 1 where |V| is the number of vertices in the graph. Therefore, if we relax all edges |V| - 1 times, we will end up with the shortest path from source to given vertices. NOTE: This implmentation does not detect the presence of negative cycles in the graph.
Read more about Bellman-Ford here:
- Create a custom graph using text input or use one of the default ones!
- Specify custom source vertex
- Press "next" to go step-by-step through the execution of BF.
- Press "previous" to go back a step in the execution.
- Color of the edges and vertices changes when thier distance is updated
- View Distance matrix and Parent list
- Visit the live deployment.
- Create a new graph, or use one of the existing ones. To create a new graph,
- Enter the edges of the graph in the text input box labeled "Edges". Each edge of the graph must be on a new line. An edge is represented by src, dest and weight seperated by "
," in that order. e.g.a, b, 10
- Enter the edges of the graph in the text input box labeled "Edges". Each edge of the graph must be on a new line. An edge is represented by src, dest and weight seperated by "
- Enter a source vertex. Bellman Ford will compute the shortest distance to every other vertex from the source vertex. The source vertex you enter must be present in the graph.
- Click the "Save" button. You should now see a graph corresponding to the edges you entered on the right side of this screen.
- Press the "Start" button. The "Next" button should now be enabled.
- Press the "Next" button to go through each step of Bellman-Ford's execution on this graph. The "Next" button will be disabled once you have gone through all the steps.
- React
- JavaScript
- VisGraph
- Netlify
- node
- Clone this repository:
git clone https://github.com/shashwatrathod/bellman-ford-visualizer.git cdinto the project foldercd path/to/bellman-ford-visualizer- Install all the dependencies:
npm install - Start development server
npm start