https://github.com/mainakrepositor/graph-node-generator

Generate graphs from nodes using graph theorem and graph traversal algorithms
https://github.com/mainakrepositor/graph-node-generator

data-structures dsa-algorithm frontend graph graph-algorigthms html-css-javascript js programming

Last synced: about 1 month ago
JSON representation

Generate graphs from nodes using graph theorem and graph traversal algorithms

• Host: GitHub
• URL: https://github.com/mainakrepositor/graph-node-generator
• Owner: MainakRepositor
• Created: 2021-10-30T07:03:30.000Z (about 3 years ago)
• Default Branch: master
• Last Pushed: 2021-12-31T13:43:37.000Z (almost 3 years ago)
• Last Synced: 2024-05-11T05:46:18.676Z (8 months ago)
• Topics: data-structures, dsa-algorithm, frontend, graph, graph-algorigthms, html-css-javascript, js, programming
• Language: JavaScript
• Homepage: https://node-graph-generator.netlify.app/
• Size: 296 KB
• Stars: 22
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Graph-Node-Generator

Generate graphs from nodes using graph theorem and graph traversal algorithms

## Screenshot:

![image](https://user-images.githubusercontent.com/64016811/139532039-54ef093b-a796-496f-976a-fb31afefc5e5.png)

## Tech Stack:

- HTML

- CSS

- JavaScript

- Bootstrap

## Overview:

Used to generate, add or delete nodes, link the nodes using a GUI based approach and form graphs. Then one can find the shortest path between a start node and an end node as specified by the user through the input boxes. A build log is also displayed on the right sidebar of the application. This contains the instructions to guide an user and also the calculations of the shortest path. If a possible path doesn't exist between any pair of nodes that falls in the path of calculation, then shortest path length is displayed as null. 

## Idea:

- Uses graph traversal algorithms.

- The nodes are numbered using a memory based approach. 

- Uses backtracking algorithm while finding the shortest path.

- Node numbers and calculations based on the path traced are dynamic.

## Creator of the Project:




  Mainak Chaudhuri