Ibarhim M.I. Zebari

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 · 2025

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 cl...