├── README.md
├── bootstrap.min.css
├── img
├── add-line.png
├── add-node.pdn
├── add-node.png
├── bg.png
├── delete-line.pdn
├── delete-line.png
├── delete-node.pdn
├── delete-node.png
├── favicon.PNG
├── favicon.ico
├── move-node.pdn
└── move-node.png
├── index.html
├── js
├── algorithms.js
├── jquery-3.4.1.slim.min.js
└── scripts.js
└── styles.css
/README.md:
--------------------------------------------------------------------------------
1 | # Graph-Node-Generator
2 | Generate graphs from nodes using graph theorem and graph traversal algorithms
3 |
4 | ## Screenshot:
5 | 
6 |
7 | ## Tech Stack:
8 | - HTML
9 | - CSS
10 | - JavaScript
11 | - Bootstrap
12 |
13 | ## Overview:
14 | 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.
15 |
16 | ## Idea:
17 | - Uses graph traversal algorithms.
18 | - The nodes are numbered using a memory based approach.
19 | - Uses backtracking algorithm while finding the shortest path.
20 | - Node numbers and calculations based on the path traced are dynamic.
21 |
22 | ## Creator of the Project:
23 |
24 |