{"id":19870998,"url":"https://github.com/mainakrepositor/graph-node-generator","last_synced_at":"2025-05-02T09:30:22.507Z","repository":{"id":45204733,"uuid":"422809194","full_name":"MainakRepositor/Graph-Node-Generator","owner":"MainakRepositor","description":"Generate graphs from nodes using graph theorem and graph traversal algorithms","archived":false,"fork":false,"pushed_at":"2021-12-31T13:43:37.000Z","size":303,"stargazers_count":21,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-04-07T00:33:32.380Z","etag":null,"topics":["data-structures","dsa-algorithm","frontend","graph","graph-algorigthms","html-css-javascript","js","programming"],"latest_commit_sha":null,"homepage":"https://node-graph-generator.netlify.app/","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/MainakRepositor.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2021-10-30T07:03:30.000Z","updated_at":"2025-02-03T07:05:57.000Z","dependencies_parsed_at":"2022-08-30T06:00:43.625Z","dependency_job_id":null,"html_url":"https://github.com/MainakRepositor/Graph-Node-Generator","commit_stats":null,"previous_names":[],"tags_count":0,"template":true,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MainakRepositor%2FGraph-Node-Generator","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MainakRepositor%2FGraph-Node-Generator/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MainakRepositor%2FGraph-Node-Generator/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MainakRepositor%2FGraph-Node-Generator/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MainakRepositor","download_url":"https://codeload.github.com/MainakRepositor/Graph-Node-Generator/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252015713,"owners_count":21680815,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["data-structures","dsa-algorithm","frontend","graph","graph-algorigthms","html-css-javascript","js","programming"],"created_at":"2024-11-12T16:10:54.038Z","updated_at":"2025-05-02T09:30:22.201Z","avatar_url":"https://github.com/MainakRepositor.png","language":"JavaScript","readme":"# Graph-Node-Generator\nGenerate graphs from nodes using graph theorem and graph traversal algorithms\n\n## Screenshot:\n![image](https://user-images.githubusercontent.com/64016811/139532039-54ef093b-a796-496f-976a-fb31afefc5e5.png)\n\n## Tech Stack:\n- HTML\n- CSS\n- JavaScript\n- Bootstrap\n\n## Overview:\nUsed 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. \n\n## Idea:\n- Uses graph traversal algorithms.\n- The nodes are numbered using a memory based approach. \n- Uses backtracking algorithm while finding the shortest path.\n- Node numbers and calculations based on the path traced are dynamic.\n\n## Creator of the Project:\n\n\u003ccenter\u003e\n\u003ctd align=\"center\"\u003e\u003ca href=\"https://mainakfolio.netlify.app\" target=\"_blank\"\u003e\u003cimg src=\"https://avatars.githubusercontent.com/u/64016811?v=4\" width=\"300px;\" alt=\"\"/\u003e\u003cbr/\u003e\n  \u003cb\u003eMainak Chaudhuri\u003c/b\u003e\u003c/a\u003e\u003c/td\u003e\n\u003c/center\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmainakrepositor%2Fgraph-node-generator","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmainakrepositor%2Fgraph-node-generator","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmainakrepositor%2Fgraph-node-generator/lists"}