<｜begin▁of▁sentence｜>### Instruction:
Given a barbell graph created with 'nx.barbell_graph(5, 0)' where the parameter zero indicates that there is a single edge (bridge) connecting two complete graphs, how can you find all the bridge-connected components (also known as 2-edge-connected components) using NetworkX?
### Response:
import networkx as nx
from networkx.algorithms.connectivity.edge_kcomponents import bridge_components

# Create the barbell graph with parameter zero
G = nx.barbell_graph(5, 0)

# Find bridge-connected components
components = sorted(map(sorted, bridge_components(G)))
print(components)
<|EOT|>
