Graph Theory Algorithm Visualizer

Welcome to the Graph Theory Algorithm Visualizer! This project is a single-page application built using HTML, CSS, JavaScript, and HTML Canvas to visualize various graph theory algorithms.

Table of Contents

• Features
• Algorithms Included
• Usage
• Skills Used
• Photos
• Contributions
• Contact

Features

• Visualization of Algorithms: Explore algorithms such as DFS, BFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Prim, and more.
• Interactive Interface: Add, remove, and modify nodes and edges on the canvas with support for weighted and unweighted graphs.
• Color-Coded Visualizations: Nodes and edges are color-coded to indicate processing stages and results for better understanding.
• Adjustable Speed: Customize visualization speed to suit your learning pace.
• Intuitive User Experience: Enhance your understanding of complex algorithms through an intuitive and user-friendly interface.

Algorithms Included

• Depth First Search (DFS)
• Breadth First Search (BFS)
• Dijkstra's Algorithm
• Bellman-Ford Algorithm
• Floyd-Warshall Algorithm
• Bridges and Articulation Points
• Tarjan's Algorithm
• Bellman-Held-Karp Algorithm
• Hierholzer's Algorithm
• Prim's Algorithm
• Ford-Fulkerson Algorithm
• Edmonds-Karp Algorithm
• Dinic's Algorithm

Usage

1. Clone this repository.
2. Open index.html in your web browser.
3. Select an algorithm from the dropdown menu.
4. Use the buttons to add/remove nodes and edges, adjust visualization speed, and start the algorithm visualization.

Skills Used

• HTML
• CSS
• JavaScript
• HTML Canvas

Photos

• Trajan Algorithm

• 

• Bridges and Articulation Points

• 

• Dijkstra

• 

• Ford-Fulkerson

• 

Contributions

Contributions are welcome! If you have any suggestions, bug fixes, or improvements, feel free to open an issue or submit a pull request.

Contact

For any inquiries or feedback, please contact Hasti Hajipara.