Graph-Algorithms-Online

Graph Algorithms Online

Implementation of 8 Graph Algorithms in JavaScript

View Demo . Report Bug . Request Feature

Table Of Contents

• Graph-Algorithms-Online
  • Table Of Contents
  • About The Project
  • Algorithms
  • Usage
  • Screenshots
  • Live Demo

About The Project

Graph algorithms play a crucial role in solving problems related to networks, connectivity, and relationships. This website aims to provide a collection of graph algorithms that are suitable for online scenarios.

Algorithms

The website currently includes implementations for the following graph algorithms:

• Breadth-First Search (BFS)
• Depth-First Search (DFS)
• Gluttonous Coloring Algorithm
• Welsh-Powell Algorithm
• Prim's Algorithm
• Kruskal's Algorithm
• Bellman-Ford Algorithm
• Dijkstra's Algorithm

Usage

To use any of the graph algorithms in your project, follow these steps:

1. Clone the repository:

git clone https://github.com/hamzaezzine/Graph-Algorithms-Online.git

Screenshots

• Home Page :

• Example :

• Result :

Live Demo

Check the website online : Graph Algorithms Online