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

Generate nodes of graphs, add them with the help of lines, delete the joining lines, increase the weights and perform all sorts of calculations on the traversal to understand graphs in depth
https://github.com/mainakverse/graph-node-generator

algorithms data-strctures graph traversal

Last synced: over 1 year ago
JSON representation

Generate nodes of graphs, add them with the help of lines, delete the joining lines, increase the weights and perform all sorts of calculations on the traversal to understand graphs in depth

• Host: GitHub
• URL: https://github.com/mainakverse/graph-node-generator
• Owner: MainakVerse
• Created: 2025-02-27T08:11:01.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2025-02-27T08:13:57.000Z (over 1 year ago)
• Last Synced: 2025-02-27T11:51:25.432Z (over 1 year ago)
• Topics: algorithms, data-strctures, graph, traversal
• Language: JavaScript
• Homepage: https://node-graph-generator.netlify.app/
• Size: 290 KB
• Stars: 1
• Watchers: 1
• 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.