Tarjan's algorithm
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after Robert Tarjan.
Proper noun[edit]
- (graph theory) An algorithm for finding the strongly connected components (SCCs) of a directed (connected) graph by using the depth-first search function.