Small World Average Path Length Simulation

This article presents a simulation program for analyzing average path length in small-world networks and studying the variation of degree-to-random network ratios. The program is implemented in MATLAB and has undergone comprehensive analysis and testing. Our implementation utilizes fundamental network algorithms including Dijkstra's algorithm for single-source shortest path calculations and Floyd's algorithm for all-pairs shortest path computations to determine network average path lengths. The code features modular functions for network generation, path length calculation, and ratio analysis. We conducted detailed investigations into network topological structures, examining emerging patterns and characteristics through systematic parameter variations. The program incorporates visualization components to display network evolution and metric changes. We hope this tool proves valuable for network science research, and welcome constructive feedback and suggestions for further improvement.