Tarjan's algorithm
English
Etymology
Named after Robert Tarjan.
Proper noun
- (graph theory) An algorithm for finding the strongly connected components (SCCs) of a directed (connected) graph by using the depth-first search function.
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.