Algorithmic software
Shortest Path Graph Solver
A graph-theory application that solves paths and helps users understand optimal routes through complex networks visually.
Project goal
Transform abstract shortest-path algorithms into a visual, interactive learning tool.
Features
- Visual node and edge editing
- Multiple shortest-path algorithms
- Step-by-step result visualization
- Graph data import and export
Technical architecture
A graph data model forms the core of the application. Algorithms such as Dijkstra are encapsulated as independent modules, with each calculation state mapped to the visual interface.
Development process
- 01Modeled nodes, edges, and weights
- 02Designed visual states for each algorithm step
- 03Added boundary-condition and invalid-input handling
Challenge & outcome
The result needed to be explainable rather than simply presenting a final answer. Highlighted paths and step-by-step states make the calculation process visible.
Received a computer software copyright registration and completed the full journey from algorithm implementation to usable software.