Skip to content

Add Tarjan's strongly connected components algorithm #636

@TripleCamellya

Description

@TripleCamellya

Tarjan algorithm is another important algorithm for finding strongly connected components(SCCs) in directed graph. Comparing to Kosaraju algorithm, Tarjan doesn't need to generate transpose Graph.

See in https://en.wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions