---
title: "Discussion on \"Tarjan’s Algorithm: Finding Strongly Connected Components (SCC) step-by-step\" | Hashnode"
description: "Discussion on \"Tarjan’s Algorithm: Finding Strongly Connected Components (SCC) step-by-step\". Master graph partitioning by deriving and implementing Tarjan's linear-time SCC algorithm in Java."
url: "https://hashnode.com/posts/tarjans-strongly-connected-components-algorithm/6a343e67ab6530ee9fe5b315"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Tarjan’s Algorithm: Finding Strongly Connected Components (SCC) step-by-step](https://abstractalgorithms.hashnode.dev/tarjans-strongly-connected-components-algorithm?utm_source=hashnode&utm_medium=feed)

Master graph partitioning by deriving and implementing Tarjan's linear-time SCC algorithm in Java.

Jun 18 · 11 min read · abstractalgorithms.hashnode.dev  
Read the article

-   [#java](https://hashnode.com/tag/java)
-   [#dsa](https://hashnode.com/tag/dsa)
-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#graph-theory](https://hashnode.com/tag/graph-theory)

## Written by

[Abstract Algorithms](https://hashnode.com/@abstractalgorithms)

@abstractalgorithms

  
[View profile](https://hashnode.com/@abstractalgorithms)

Exploring the fascinating world of algorithms, data structures, and software engineering through clear explanations and practical examples.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.