diff --git a/src/graph/bridge-searching-online.md b/src/graph/bridge-searching-online.md index 80ed25ead..1169fc146 100644 --- a/src/graph/bridge-searching-online.md +++ b/src/graph/bridge-searching-online.md @@ -57,7 +57,7 @@ When adding the next edge $(a, b)$ there can occur three situations: In this case, this edge forms a cycle along with some of the old bridges. All these bridges end being bridges, and the resulting cycle must be compressed into a new 2-edge-connected component. - Thus, in this case the number of bridges decreases by two or more. + Thus, in this case the number of bridges decreases by one or more. Consequently the whole task is reduced to the effective implementation of all these operations over the forest of 2-edge-connected components. pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy