Tarjan's algorithm is used to find bridges in a graph. A bridge is an edge that, when removed, increases the number of connected components in the graph.