🌐 Link-State Routing Algorithm with Visualization

This project is a Link-State Routing Algorithm implementation using Flask and NetworkX. It allows users to visualize routers, links, and costs dynamically with an interactive interface.

---

🚀 Features

✅ Add and remove routers dynamically
✅ Add, modify, and remove links with costs
✅ Visualize the network graph in real-time
✅ Implement Dijkstra’s algorithm for finding the shortest path
✅ User-friendly web interface

---

🛠️ Tech Stack

• Python (Flask, NetworkX, Matplotlib)
• HTML/CSS (For the frontend interface)
• JavaScript (AJAX for dynamic updates)

⚙️ Installation & Setup

Follow these steps to set up the project in a virtual environment:

1️⃣ Clone the Repository

git clone https://github.com/Nayanpawar03/Link-State-Routing.git
cd Link-State-Routing

2️⃣ Create a Virtual Environment

python -m venv venv

3️⃣ Activate the Virtual Environment

venv\Scripts\activate

4️⃣Install Dependencies

pip install -r requirements.txt

5️⃣Run the Application

python app.py

🖥️ How to Use Add Router – Enter the router name and click "Add".

Add Link – Specify two routers and enter the link cost.

Modify Link Cost – Enter new cost values to update links.

Remove Router/Link – Instantly deletes the router or link from the graph.

Shortest Path Calculation – Enter a source router to calculate optimal paths.

🤝 Contributing Contributions are welcome! If you'd like to improve the project, feel free to fork the repository and submit a pull request.