Interactive Java application for exploring how regular ring lattices transition into small-world networks
through edge rewiring, with real-time metrics and multiple graph views.
Desktop simulation with graph theory under the hood.
The application demonstrates the Watts-Strogatz model by showing how increased rewiring probability changes
clustering behavior and average path lengths. The interface is built in Java Swing with FlatLaf-based presentation,
while graph calculations rely on object-oriented modeling and Apache Commons Math.
Demo
Live demonstration
Key features
Key technical features
Switches between ring lattice and force-directed graph views.
Uses spectral clustering with Laplacian matrix analysis and the Fiedler vector.
Recalculates average path length, diameter, and clustering metrics in real time.
Supports interactive tuning of network size, mean degree, and rewiring probability.
What it demonstrates
What this project demonstrates
This project shows strong comfort with desktop application structure, visual explanation of abstract systems,
and turning mathematical graph concepts into an interface someone can actively explore instead of only read about.