Skip to content

A web-based application for visualizing classical graph algorithms such as BFS, DFS and Minimum Spanning Tree. Provides dynamic graph creation, pathfinding visualization, and step-by-step execution.

Notifications You must be signed in to change notification settings

KunjBhawsar/Graph-Algorithm-Visualiser

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

31 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Graphixor - Graph Algorithm Visualizer 📈📉

Graphixor is an interactive Graph Algorithm Visualizer tool that visually demonstrates how popular graph algorithms work step-by-step. You can create nodes, connect edges, and watch algorithms like BFS, DFS, and Minimum Spanning Tree run in real time. This project helps beginners, students, and developers clearly understand graph traversal and shortest-path techniques.

Features

Interactive graph creation (add nodes & edges)

Visualization of BFS and DFS traversal

Minimum Spanning Tree algorithm animation

Highlights visited nodes and final path

Adjustable graph and algorithm controls

Clean and beginner-friendly UI

Educational and great for learning DSA concepts

Requirements

HTML

CSS

JavaScript

Installation / Setup

Follow the steps below to run the project on your system:

1. Download or Clone the Repository

• Click on the Code button

• Select Download ZIP

• Extract the ZIP file (Or use git clone if you prefer)

2. Keep all file names exactly as they are

Do not rename or modify any file. Make sure all the files in respective folders to be saved in a single project folder only. The project depends on the original file structure to work correctly. image

3. Open the Project

Locate the file named welcome.html inside the project folder.

4. Run the Project

Right-click on welcome.html → Select Open with → Choose your web browser (Chrome, Edge, Firefox, etc.)

5. The Graph Algorithm Visualizer will launch in your browser and is ready to use 🚀

License

This project is open-source and available for free use. You are welcome to modify, enhance, or redistribute it for personal, educational, or experimental purposes.

About

A web-based application for visualizing classical graph algorithms such as BFS, DFS and Minimum Spanning Tree. Provides dynamic graph creation, pathfinding visualization, and step-by-step execution.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published