Network reliability analysis is vital for ensuring efficient and error-free communication within networking and communication applications. Binary Decision Diagrams (BDDs) have emerged as a powerful tool for analyzing and optimizing complex network infrastructures. The objective of this research paper is to conduct a comparative analysis of edge-ordering algorithms for network reliability using BDDs the study aims to evaluate and compare existing algorithms, providing valuable insights for selecting suitable edge-ordering algorithms that enhance network reliability. The paper concludes that snooker is outperforming among selected algorithms.