The English Wikipedia article on Tarjan's Strongly Connected Components Algorithm, consulted for its lead-section description. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
PublisherWikimedia Foundation
Urlhttps://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
Source TypeReference Work
Reliability Tier2
General encyclopedia reference, actively edited; tier 2 matching the family's existing Wikipedia source entities. Sources
Wikipedia: Tarjan's Strongly Connected Components Algorithm
Wikimedia FoundationLead sectionQuote, Lead section
Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph.
Claims Backed By This Source (15 claims)
This source backs 15 claims across the atlas. As facts: 8 well-attested. As cited relationships: 4 holds. Plus 3 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Algorithms, 10 claims: 3 well-attested, 4 holds, 3 general references.
- Sources, 5 claims: 5 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.