figure an undirected graph figure depth-first search of previous graph biconnectivity connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph the graph in figure is biconnected if the nodes are computers and the edges are linksthen if any computer goes downnetwork mail is