Tarjan's algorithm

proper noun

An algorithm for finding the strongly connected components (SCCs) of a directed (connected) graph by using the depth-first search function.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  1. graph theoryAn algorithm for finding the strongly connected components (SCCs) of a directed (connected) graph by using the depth-first search function.

Origin

Named after Robert Tarjan.

Full word history & related roots →
Cite this entry
APA

Tarjan's algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Tarjan's%20algorithm

MLA

“Tarjan's algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Tarjan's%20algorithm. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Tarjan's algorithm,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Tarjan's%20algorithm.

Source: Tarjan's algorithm on Wiktionary, CC BY-SA 4.0.