A bridge tree is a condensed graph where each -edge-connected component becomes a single node, and bridges become edges between nodes. The bridge tree is always a tree (no cycles) because bridges cannot form cycles by definition.
Bridge trees are useful for solving path queries and tree algorithms on graphs with cycles. Compress each cycle into a node, then solve the tree problem on the simplified structure.