How silverarrow77/shortest-path-finder works
This repository appears to be a shortest-path graph tool with a command-line workflow and a browser visualization. A user loads a graph, selects endpoints and an algorithm, and receives path results that can be visualized. The C source contains graph handling, algorithm implementations, and output generation; the JavaScript visualizer fetches graph.json and displays the graph and chosen path. No README is present, and the available source excerpts are partial, so links to unsampled UI or graph-loading details are omitted.
Main entry points: graph.c CLI workflow · graph.json Graph results · final.js Browser visualizer · graph-data.js Graph snapshot
Components 8
Graph and algorithms
- CLI workflow
graph.c - Graph model
graph.c - Path algorithms
graph.c - Result export
graph.c
Path visualization
- Browser visualizer
final.js
Generated data
- Graph results
graph.json - Graph snapshot
graph-data.js
Other components
- User
Connections 8
- User → CLI workflow: enters choices
graph.c - CLI workflow → Graph model: loads graph
graph.c - CLI workflow → Path algorithms: selects and runs
graph.c - Path algorithms → Graph model: reads adjacency
graph.c - CLI workflow → Result export: writes results
graph.c - Result export → Graph results: writes JSON
graph.c - Result export → Graph snapshot: writes snapshot
graph.c - Browser visualizer → Graph results: fetches data
final.js