graph-visualization/graph-api

Backend containing all the algorithms of graphs

graph-api's Issues

Instructions for running the backend

It would be nice if someone could document the instructions required to run the backend in the local computer.

Since this is a priority issue, the maintainers would self-assign this after 10th December.

Anyone with basic knowledge of NodeJS can easily document the steps.

Revamp the Base Class for graph representation

Currently, we use the graph_base.js as a base class for Graph Objects. Different Algorithms use this class for creating a graph object using the public methods that we have currently. However, the internal implementation of graph methods is really obfuscated/complex, which makes it tough to understand and maintain.

Simplify the internal implementation of the graph object.

Before solving the issue, please discuss a small implementation approach before sending in a PR.

Implement All Pairs Shortest Path

• Floyd Warshall's Algo

Implement the Special Graphs and basic algorithms for them

Implement all types of traversal for -

• Trees

Implement an algorithm to detect if a graph is -

• Eulerian
• Directly Acyclic Graph

Creating Goroutines for faster computation

Currently our tech-stack uses NodeJS for backend and Vanilla JS for frontend. We would love to add in a separate backend service using Golang for running algorithms in a distributed manner(using goroutines for tasks) which can be parallelized.

This is an advanced issue, so it would require planning and approach to solve it, more like a rough proposal about the implementation details, before tackling it.
Requires basic knowledge of Golang and HTTP package of Golang, along with knowledge of Goroutines.

Implement Single Source Shortest Path

Implement Algorithms for -

SSSP on unweighted graph
SSSP on weighted graph
SSSP on Graph with negative weight cycle

More Info - https://en.wikipedia.org/wiki/Shortest_path_problem#Single-source_shortest_paths
Ping @Biswajitghosh98 for more details about the individual algorithms

Implement the algorithms for Graph Traversal II

Algorithms for Graph Traversal II -

• Bipartite graph check
• Graph edges property check via DFS spanning tree
• Finding articulation points and bridges
• Finding strongly connected components in directed

Implement Network Flow Algorithms

• Ford Fulkerson's Method
• Edmond Karp's Algo
• Flow Graph Modelling

Adding ESLint and Prettier GitHub Actions

Implement the algorithms for Graph Traversal - I

Algorithms for Graph Traversal I -

• TopoSort / Cycle Detection
• Finding connected components (Undirected)
• Flood Fill
• Topological Sort (Directed acyclic graph)

Implement the algorithms for Minimum Spanning Tree

Implement the following algorithms for MST -

• Kruskal
• Prim

Prettier is failing in the Github Actions

We have observed that all the checks are failing for prettier linting. Some issues are there with the github action yaml file for prettier.

Add Contributors name

Add Contributors name using a bot.

Visualizing the output

This feature was part of this project since its inception. However, for simplicity purpose, we still haven't worked on this issue yet, so it would be nice to visualize the algorithms that are used. Currently, we have only graph algorithms, so any visualization of output using graph algorithms would be nice for the user to consume them.

Cleanup of the website

The current structure contains a lot of files in a scattered way.
Restructure the files as follows -

• src - contains the app.js and all the HTML/CSS files
• algorithms - contains all the algorithms associated with the app
• visualization - contains all the codes for visualization
• ads - Contains all the Abstract Data Structures and Base Classes.

Or if time permits, a stretch goal can be to structure the codebase as - link