Skip to content

Latest commit

 

History

History
33 lines (21 loc) · 1.45 KB

README.md

File metadata and controls

33 lines (21 loc) · 1.45 KB

Graph Algorithm Visualization 📊

This project aims to provide a visualization tool for graph algorithms. It offers an interactive environment to visualize the workings of various graph algorithms such as Breadth First Search, Dijkstra's Algorithm, and more; View and display algorithms at https://graph.komlankodoh.com/editor

Supported Algorithms 🛠️

  • Depth First Search
  • Breath First Search
  • Dijkstra Algorithm
  • Minimum Node Coloring
  • Maximum independent set
  • Vertex Eccentricity
  • Louvain method for community detection

Features 🚀

  • Interactive Visualization: Watch as the algorithms traverse through the graph in real-time, with each step visualized for easy understanding.
  • Custom Graph Input: Users can input their custom graphs to observe the algorithms' behavior on different types of graphs.
  • Step-by-Step Explanation: Each step of the algorithm is explained, helping users understand the logic behind the algorithm's operation.

Contributing 🤝

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

License 📜

This project is licensed under the GPLv3 License - see the LICENSE file for details.

Social Media