search

codezonediitj / pydatastructs

A python package for data structures and algorithms
https://pydatastructs.readthedocs.io/en/stable/
Other
201 stars 267 forks source link

Tarjan's Algorithm #395

Closed U-c0de closed 3 years ago

U-c0de commented 3 years ago

Description of the problem

Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph.

Example of the problem

Input: Adjacency matrix of the graph. 0 0 1 1 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0

Output: The strongly connected components: 4 3 1 2 0

U-c0de commented 3 years ago

@czgdp1807 Assign this to me