You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
An interactive offline desktop application for visualizing computer science algorithms, built in JavaFX, featuring time-travel step controls (forward and backward) and a fully featured local code compilation sandbox for C, C++, Java, and Python.
Interactive JavaFX application to visualize and simulate graph algorithms (Dijkstra, A*, Bellman-Ford, MST, max flow) on transport networks with step-by-step execution.
Java project providing implementations of core graph data structures and algorithms, including BFS, DFS, shortest paths, and minimum spanning trees, designed for learning and practical use.
Full-stack route planner and algorithm visualizer. A Java 21 / Spring Boot REST API implements Dijkstra (custom min-heap), A*, BFS, DFS and Floyd–Warshall on a grid and reports path, search order and runtime. React + TypeScript frontend.