Tarjan's algorithm: Solve the cut points and bridges (cut edges) of a graph

Introduction

The definition of cut edges and cut points is limited to undirected graphs. We can solve all cut points and cut edges of an undirected graph in a brute force way by definition, but this way of solving is inefficient. Tarjan proposed a fast solution method to solve all cut points and edges in the graph through one DFS.