tarjan's algorithm

Fetched 2026-10-26 (cache).

Datamuse reports no synonyms or antonyms for this word.

Proper noun

1. {{lb|en|graph theory}} An [[algorithm]] for finding the [[strongly connected component]]s ([[SCCs]]) of a [[directed graph|directed]] ([[connected graph|connected]]) [[directed graph|graph]] by using the [[depth-first search]] function.

Source: Wiktionary · CC BY-SA 4.0 (Wiktionary dump) · cached copy, not a rewrite.