Contemporary society depends on several network infrastructures, such as telecommunication and transportation. Analysis of such infrastructures is essential for, e.g., designing high-performance networks and finding vulnerable network components. This analysis often necessitates considering combinations of network components such as roads and optical fibers. However, combinations result in a prohibitive increase in computational time, preventing us from performing the analysis sufficiently in a reasonable time. In this talk, we introduce efficient algorithms using a decision diagram, which represents an enormous number of combinations in a compressed form, to tackle computationally challenging analysis problems.