A Review of Python Graph Algorithms: Utilization and Efficiency

Author(s)	Neha Nagda
Country	India
Abstract	Graph algorithms play a critical role in solving various real-world computational problems, ranging from social network analysis to biological data processing. This review focuses on the implementation, comparison, and efficiency of graph algorithms using Python libraries such as NetworkX, igraph, and Graph-tool. We analyze traversal, shortest path, minimum spanning tree, and network flow algorithms in terms of performance and real-world applicability. The paper also examines the strengths and weaknesses of these libraries, providing a comprehensive comparison based on time complexity, space complexity, and practical execution time.
Keywords	Python, Graph Algorithms, NetworkX, igraph, Graph-tool, BFS, DFS, Dijkstra, Kruskal.
Field	Engineering
Published In	Volume 16, Issue 2, April-June 2025
Published On	2025-04-20
Cite This	A Review of Python Graph Algorithms: Utilization and Efficiency - Neha Nagda - IJSAT Volume 16, Issue 2, April-June 2025. DOI 10.71097/IJSAT.v16.i2.3562
DOI	https://doi.org/10.71097/IJSAT.v16.i2.3562
Short DOI	https://doi.org/g9gdtt

About IJSAT Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us	Message on WhatsApp	+91-9687-182-185	editor@ijsat.org

International Journal on Science and Technology