Forum Overview :: S.T.A.L.K.E.R. :: Graph theory

[quote name="Bananadine"][quote name="Wikipedia"]A graph is said to be bridgeless if it contains no bridges, this includes having no bridges, but if it has a bridge then it isnot bridgeless, this has to have no bridges, and this means none whatsoever, not even a little one. It is easy to see that this is equivalent to 2-edge-connectivity of each nontrivial component.[/quote][/quote]