GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing rulcode.com — Tarjan's Algorithm Visualizer & Solution | Rulcode

Fetching algorithms...

Tarjan's Algorithm Visualizer & Solution | Rulcode

Loading problem details...

64. Tarjan's Algorithm

Hard

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: graph = [[1, 3], [2], [0], [2]]

Output: [[[0, 1, 2, 3]]]

Explanation: The graph has one strongly connected component consisting of all the nodes.

Example 2:

Input: graph = [[1], [2], [3], [0]]

Output: [[0, 1, 2, 3]]

Explanation: All nodes form a single strongly connected component because they form a cycle.

Example 3:

Input: graph = [[1], [2], [0], [4, 5], [5], [6], [4]]

Output: [[4, 5, 6], [0, 1, 2], [3]]

Explanation: There are three SCCs: {4, 5, 6}, {0, 1, 2}, and {3}.

Constraints:

Time Complexity

O(V+E)

Space Complexity

O(V)

You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.