Year: 2025
Type: article
Abstract: Graph theory is a fundamental branch of mathematics with diverse applications in computer science and various other fields. This research provides an analytical overview of essential graph algorithms, focusing on the Depth-First Search, Breadth-First Search, Prim's algorithm, and Kruskal's algorithm for finding minimum spanning trees. Through an in-depth exploration of these algorithms, this study aims to shed light on their principles, advantages, and applications. The insights gained from this research can be valuable in solving real-world problems that involve networks and optimization.
Source: Qalaai Zanist Scientific Journal
Authors: Kamaran Jamal Hamad, Salim S. Mahmood
Institution: Soran University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4409207877