Thematic summary of connected graphs (Tarjan algorithm)

I. Type of topic:

1. Strongly connected components of a graph:

POJ1236 Network of schools

HDU1269 Maze Castle

2. Cutting Point & cutting edge:

UESTC-900 Fang Teacher Bomb

UVA315 Network

UVA796 Critical Links

HDU3394 Railway

3. The side double Unicom component of the graph without direction:

POJ3177 redundant Paths

HDU4612 Warm up

HDU4738 Caocao ' s Bridges

POJ3694 Network

4. The point of the non-graph of the two components:

HDU3394 Railway

5. Pinch point:

POJ3694 Network

POJ1236 Network of schools

POJ3177 redundant Paths

HDU4612 Warm up

6. Heavy-side:

HDU4738 Caocao ' s Bridges

HDU4612 Warm up

Thematic summary of connected graphs (Tarjan algorithm)