Graph algorithm Visualizer application for tracing Warshall and Floyds Algorithm and visualize them using graphs.
The application allows user to enter adjacency matrices as input and calculates the transitive closure in case of Warshall algorithm and the shortest path between each node for Floyds Algorithm. Then the output of the algorithm is pictorially represented using Graphs rendered using Cytoscape.js. The entire application is build using React and other supported packages.
A working installation of Node.js, npm and Git verison control system is enough to start the project.
Instructions for Node installation can be found here.
Instructions for Git installation can be found here.
NPM - a package manager for node is installed with Node.js.
This project is built on the React a JavaScript library for building user interfaces.
- Clone the project from GitHub using the following command.
git clone https://github.com/abhayhk2001/ReactDjango-Todo
- Move into the created directory and start the native terminal in this directory. Install the required node modules for running the project.
$ npm install
- Start the React development server with the following commands.
$ npm start
Here are some of the changes to the project which I would like to incorporate into the project.
- Allows users to enter graphs pictorially.
- Add other important graph algorithms to the application.
- Allow users to change the underlining algorithm and experiment with their own modifications so they are able to learn better.
Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/Ne wFeature) - Commit your Changes (
git commit -m 'Add some NewFeature') - Push to the Branch (
git push origin feature/NewFeature) - Open a Pull Request
Distributed under the MIT License. See LICENSE for more information.
Abhay H Kashyap - @AbhayHKashyap1