A New Approach to find Articulation Points and Bridges in Undirected Graphs

Abstract

Articulation points And Bridge illustrate weak spots in a connected network graph, single points that, if they failed, would cause the network to break into two or more halves. SPOF stands for Single Point of Failure, which has the potential to render a system completely useless. SPOF that is Single Point of Failure is essentially a weakness in the blueprint or configuration of a system or circuit, or execution of a system, circuit, or component that bearing a possible peril because it can result in a scenario where there is just one issue or malfunction stops the entire system from working. The cargo ship “Ever Given” became stranded in the Suez Canal in 2021. The ship became stuck in a crucial area of the canal that was working as a single channel. The obstruction rendered the whole canal's cargo lanes inoperable. The non-redundant canal served as the lone point of failure. Understanding of articulation points and the role of a bridge in a network or in graph becomes vital when constructing trustworthy and robust networks with no single point of failure. The purpose of this study is to present an algorithm which is an elegant blend of Depth First Search and Recursion to find Articulation points And Bridge in a graph.