Skip to content
Research Article Open access CC BY 4.0

Comparing Traversal Strategies: Depth-first Search vs. Breadth-first Search in Complex Networks

Ayad Zedo Ismaeel, Ibarhim M.I. Zebari

Asian Journal of Research in Computer Science · pp. 60–73 · Published 29 Jan 2025

10.9734/ajrcos/2025/v18i2562

Abstract

This article compares and contrasts two basic graph traversal algorithms that are commonly employed in computational problem-solving and network research. Common applications of these algorithms include pathfinding, optimisation of network flows, collaborative exploration, and classification tasks. To find out how well they function with different types of datasets, network topologies, and issue domains, researchers have systematically reviewed previous works. We measured the efficiency of each solution using performance indicators like execution time, memory utilisation, and path length. According to the results, one approach is more effective in memory-constrained settings and deep searches, while the other is better at discovering the shortest paths and providing comprehensive coverage. Furthermore, the paper emphasises the advantages of hybrid techniques, which merge the best features of both algorithms to provide better results in specific cases. This comparison helps fill gaps in our knowledge of graph-based problem-solving methods and sheds light on how to choose the best traversal algorithms for different types of applications.

Graph Traversal Algorithms Depth-First Search (DFS) Breadth-First Search (BFS) complex network analysis algorithm performance comparison

Cited by 13

Enhanced product innovation design approach supported by patent knowledge graph: a novel path completion and retrieval method

Yu-Bo Dou, Shao-Fei Jiang, Bin-Jian Zhang · Journal of engineering design · 2026

Tokenizing Complex Passwords Using Breadth-First Search and Dictionary Matching

Salam R. Al-E'mari, Mohammad Al Sawalhi, Yousef K. Sanjalawe · IEEE Latin America Transactions · 2026

Optimising Dynamic Symbolic Execution Processes for Large-Scale Software Systems via Deep Learning-Based Neighbourhood Policies

Zhe-Heng Liang, Chao-Sheng Yao, Yi-Huan Xie · Sustainable Computing: Informatics and Systems · 2026

Reliability-oriented cyber-physical Co-planning for antarctic microgrids: A topology-capacity Bi-level optimization approach

Qiang Liu, Jia Su, Yi-Xun Xue · Energy Conversion and Management: X · 2026

Research on a fast self-healing control method for tie-line faults in regional distribution networks based on source–load–storage interaction

Chuan Zhou, Suying Gui, Guomin Gao · Scientific Reports · 2026

A novel homology-based framework for K-terminal network reliability estimation under mixed failure modes

Hongdan Zheng, Hong-Qiao Wang, P. Yin · Reliability Engineering & System Safety · 2026

LARAG: Link-Aware Retrieval Strategy for RAG Systems in Hyperlinked Technical Documentation

Giorgia Bolognesi, Claudio Estatico, Ulderico Fugacci · arXiv.org · 2026

Research on Real-time Verification Method for Low Frequency and Low Voltage Load Shedding Control Scheme

Zhi-Hang Lin, De-Fa Cao, Xiaozhen Gao · 2025 4th International Conference on Clean Energy Storage and Power Engineering (CESPE) · 2025

Global Path Planning for Intelligent Vehicles Based on a Replanning Strategy

Jie Hu, Tihang Liao, Qiong Luo · 2025 International Conference on Unmanned Systems and Technology (UST) · 2025

Showing 9 of 13 known citations — external sources report more than can currently be individually listed.

Article metrics

Real usage data collected on this platform.

6

Page views

0

PDF downloads

0

Outbound clicks

13

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.