Elaris Computing Nexus
Optimizing Graph Traversal Efficiency Using the Novel ALGO-X Framework for Theoretical and Experimental Analysis
Elaris Computing Nexus
Received On : 06 July 2025
Revised On : 22 September 2025
Accepted On : 12 October 2025
Published On : 26 October 2025
Volume 01, 2025
Pages : 195-205
Abstract
Graph traversal is a fundamental problem in theoretical computing with wide-ranging applications in network analysis, database querying, and artificial intelligence. Most classic traversal algorithms like the Depth-First Search (DFS) and the Breadth-First Search (BFS) are commonly limited in their ability to process large and complicated graph models, particularly in time complexity versus space complexity optimization. In this paper the author proposes the construction of a new framework, ALGO-X, which can be used to streamline the efficiency of developing the graph traversability by combining the use of adaptive heuristic mechanisms with the possibilities of active pruning of paths. By using the theoretical understanding of complexity analysis, ALGO-X eliminates unnecessary computations, maintaining speed without any loss of accuracy. We offer an intense theoretical examination of the workings of ALGO-X whereby, the worst-case and the average-case complexity limits are shown to be better than the classical algorithms. We also apply the framework and compare it with the benchmark graph data, such as sparse and dense graphs of different sizes. Through experiments, it has been found out that ALGO-X is always more efficient in runtime and the use of memory in comparison with the traditional traversal techniques especially in graphs of high connectivity and irregularities. Moreover, the model is general and it can be extended to particular graph tasks including shortest path computation and cycle detection. Our research is valuable to the theoretical background of graph algorithms and offers both theoretical and practical learning on scalable computing applications. Further development of this work involves parallelization approaches to ALGO-X so as to improve more on the application of this algorithm in distributed and large-scale contexts.
Keywords
Graph Traversal, Algorithm Optimization, ALGO-X Framework, Theoretical Analysis, Dynamic Path Pruning.
- Y. Wang et al., “NDSEARCH: Accelerating Graph-Traversal-Based Approximate Nearest Neighbor Search through Near Data Processing,” 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA), pp. 368–381, Jun. 2024, doi: 10.1109/isca59077.2024.00035.
- Aghsal Dwi Putra, A. Nur Maulana, S. Billa Febrianti, N. Camelia, S. Kaka Hutagalung, and A. Naseh Khudori, “Comparison of Breadth-First Search (BFS) and Depth-First Search (DFS) Algorithms for Shortest Search in Campus Labyrinth,” Journal of Enhanced Studies in Informatics and Computer Applications, vol. 2, no. 2, pp. 43–51, Jul. 2025, doi: 10.47794/jesica.v2i2.14.
- Ivanochko, M. G. ml, and S. Treľová, “Optimizing the 15 Puzzle with AI: Comparative analysis of breadth-first and depth-first search algorithms,” Procedia Computer Science, vol. 265, pp. 57–64, 2025, doi: 10.1016/j.procs.2025.07.156.
- Nauck, M. Lindner, K. Schürholt, and F. Hellmann, “Toward dynamic stability assessment of power grid topologies using graph neural networks,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 33, no. 10, Oct. 2023, doi: 10.1063/5.0160915.
- Z. Sun, Y. Mo, and C. Yu, “Graph-Reinforcement-Learning-Based Task Offloading for Multiaccess Edge Computing,” IEEE Internet of Things Journal, vol. 10, no. 4, pp. 3138–3150, Feb. 2023, doi: 10.1109/jiot.2021.3123822.
- E. Ferrentino, “A Dynamic Programming Framework for Optimal Planning of Redundant Robots Along Prescribed Paths With Kineto-Dynamic Constraints_supp1-3330371.mp4”, doi: 10.1109/tase.2023.3330371/mm1.
- C. Scoccia, G. Palmieri, M. C. Palpacelli, and M. Callegari, “A Collision Avoidance Strategy for Redundant Manipulators in Dynamically Variable Environments: On-Line Perturbations of Off-Line Generated Trajectories,” Machines, vol. 9, no. 2, p. 30, Feb. 2021, doi: 10.3390/machines9020030.
- R. AlKahtani, A. Alhabdan, M. Alosami, W. Alshammari, A. A. Abdo, and L. Hamdi, “Comparative Analysis between BFS and DFS-Shortest Path Algorithms,” 2025 IEEE Open Conference of Electrical, Electronic and Information Sciences (eStream), pp. 1–5, Apr. 2025, doi: 10.1109/estream66938.2025.11016860.
- R. Mohammed N. and J. Zeyad, “Empirical study prove that breadth-first search is more effective memory usage than depth-first search in frontier boundary cyclic graph,” IAES International Journal of Artificial Intelligence (IJ-AI), vol. 10, no. 2, p. 265, Jun. 2021, doi: 10.11591/ijai.v10.i2.pp265-272.
- J. Wang, Y. Xie, S. Xie, and X. Chen, “Cooperative particle swarm optimizer with depth first search strategy for global optimization of multimodal functions,” Applied Intelligence, vol. 52, no. 9, pp. 10161–10180, Jan. 2022, doi: 10.1007/s10489-021-03005-x.
- L. Hao, Y. Wang, Y. Bai, and Q. Zhou, “Energy management strategy on a parallel mild hybrid electric vehicle based on breadth first search algorithm,” Energy Conversion and Management, vol. 243, p. 114408, Sep. 2021, doi: 10.1016/j.enconman.2021.114408.
- L. Liu, B. Wang, and H. Xu, “Research on Path-Planning Algorithm Integrating Optimization A-Star Algorithm and Artificial Potential Field Method,” Electronics, vol. 11, no. 22, p. 3660, Nov. 2022, doi: 10.3390/electronics11223660.
- Q. Wang, Y. Hao, and J. Cao, “Learning to traverse over graphs with a Monte Carlo tree search-based self-play framework,” Engineering Applications of Artificial Intelligence, vol. 105, p. 104422, Oct. 2021, doi: 10.1016/j.engappai.2021.104422.
- H. Ootomo, A. Naruse, C. Nolet, R. Wang, T. Feher, and Y. Wang, “CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs,” 2024 IEEE 40th International Conference on Data Engineering (ICDE), pp. 4236–4247, May 2024, doi: 10.1109/icde60146.2024.00323.
- K. Figueroa and R. Paredes, “Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph,” 2009 Second International Workshop on Similarity Search and Applications, pp. 91–98, Aug. 2009, doi: 10.1109/sisap.2009.33.
- R. Xu, S. Yao, W. Gouhe, Y. Zhao, and S. Huang, “A spanning tree algorithm with adaptive pruning with low redundancy coverage rate,” Computers & Industrial Engineering, vol. 186, p. 109745, Dec. 2023, doi: 10.1016/j.cie.2023.109745.
- F. Liu, W. Zhao, Y. Chen, Z. Wang, and F. Dai, “DynSNN: A Dynamic Approach to Reduce Redundancy in Spiking Neural Networks,” ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2130–2134, May 2022, doi: 10.1109/icassp43922.2022.9746566.
- Y. Kim and P. Panda, “Optimizing Deeper Spiking Neural Networks for Dynamic Vision Sensing,” Neural Networks, vol. 144, pp. 686–698, Dec. 2021, doi: 10.1016/j.neunet.2021.09.022.
- H. N. A. Hamed, N. Kasabov, and S. M. Shamsuddin, “Dynamic Quantum-Inspired Particle Swarm Optimizationas Feature and Parameter Optimizer for Evolving Spiking Neural Networks,” International Journal of Modeling and Optimization, pp. 187–191, 2012, doi: 10.7763/ijmo.2012.v2.108.
- D. Fan, H. Cao, G. Wang, N. Nie, X. Ye, and N. Sun, “Scalable and efficient graph traversal on high-throughput cluster,” CCF Transactions on High Performance Computing, vol. 3, no. 1, pp. 101–113, Nov. 2020, doi: 10.1007/s42514-020-00056-3.
- Y. Yasui, K. Fujisawa, E. L. Goh, J. Baron, A. Sugiura, and T. Uchiyama, “NUMA-aware Scalable Graph Traversal on SGI UV Systems,” Proceedings of the ACM Workshop on High Performance Graph Processing, pp. 19–26, May 2016, doi: 10.1145/2915516.2915522.
- L. Wang, X. Dong, Y. Gu, and Y. Sun, “Parallel Strong Connectivity Based on Faster Reachability,” Proceedings of the ACM on Management of Data, vol. 1, no. 2, pp. 1–29, Jun. 2023, doi: 10.1145/3589259.
- D. Chakraborty and K. Choudhary, “New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures,” ACM Transactions on Algorithms, Mar. 2025, doi: 10.1145/3720545.
- S. Sundarraj, R. V. K. Reddy, M. B. Basam, G. H. Lokesh, F. Flammini, and R. Natarajan, “Route Planning for an Autonomous Robotic Vehicle Employing a Weight-Controlled Particle Swarm-Optimized Dijkstra Algorithm,” IEEE Access, vol. 11, pp. 92433–92442, 2023, doi: 10.1109/access.2023.3302698.
- N. S. Abu, W. M. Bukhari, M. H. Adli, S. N. Omar, and S. A. Sohaimeh, “A Comprehensive Overview of Classical and Modern Route Planning Algorithms for Self-Driving Mobile Robots,” Journal of Robotics and Control (JRC), vol. 3, no. 5, pp. 666–678, Sep. 2022, doi: 10.18196/jrc.v3i5.14683.
CRediT Author Statement
The author reviewed the results and approved the final version of the manuscript.
Acknowledgements
The author(s) received no financial support for the research, authorship, and/or publication of this article.
Funding
No funding was received to assist with the preparation of this manuscript.
Ethics Declarations
Conflict of interest
The authors have no conflicts of interest to declare that are relevant to the content of this article.
Availability of Data and Materials
Data sharing is not applicable to this article as no new data were created or analysed in this study.
Author Information
Contributions
All authors have equal contribution in the paper and all authors have read and agreed to the published version of the manuscript.
Corresponding Author
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution NoDerivs is a more restrictive license. It allows you to redistribute the material commercially or non-commercially but the user cannot make any changes whatsoever to the original, i.e. no derivatives of the original work. To view a copy of this license, visit: https://creativecommons.org/licenses/by-nc-nd/4.0/
Cite this Article
Fengbin Sun, “Optimizing Graph Traversal Efficiency Using the Novel ALGO-X Framework for Theoretical and Experimental Analysis”, Elaris Computing Nexus, pp. 195-205, 2025, doi: 10.65148/ECN/2025018.
Copyright
© 2025 Fengbin Sun. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.