Articulation Points and BridgesArticulation Point: removing a particular vertex may result in increasing the number of edges associated with its components of a graph data structure then. These points are called articulation points. They represent the vulnerabilities in each network provided to the machine for either traversal or prediction. To check for the vulnerabilities using a brute force approach, we hand pick and check each vertex and see if it is an articulation point or if the total count of the components increased or not than the vertex. Pseudocode Algorithm, which returns the count of total articulation Points Pseudo Code Bridges The bridge is the graph between any two vertices, say x and y. it is called an articulation point. When the connection/bridge is removed, it has no traversal path left. It may also represent the vulnerabilities in each network provided to the machine or system. Like articulation point, we also have to traverse through each vertex of the entire graph data structure in brute force to check for the path available by removing and checking if there is a connection among the vertices. Pseudo Code
Next TopicExecution of printf with ++ Operators
