{"id":15957933,"url":"https://github.com/finanalyst/p6-algorithm-tarjan","last_synced_at":"2026-02-26T03:01:56.860Z","repository":{"id":80341198,"uuid":"59751473","full_name":"finanalyst/p6-Algorithm-Tarjan","owner":"finanalyst","description":"perl6 implementation of Tarjan algorithm","archived":false,"fork":false,"pushed_at":"2018-10-22T06:34:13.000Z","size":33,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-01-19T00:59:27.775Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Perl 6","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"artistic-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/finanalyst.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2016-05-26T13:13:16.000Z","updated_at":"2020-04-28T09:55:48.000Z","dependencies_parsed_at":"2023-06-06T13:01:20.141Z","dependency_job_id":null,"html_url":"https://github.com/finanalyst/p6-Algorithm-Tarjan","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/finanalyst/p6-Algorithm-Tarjan","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/finanalyst%2Fp6-Algorithm-Tarjan","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/finanalyst%2Fp6-Algorithm-Tarjan/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/finanalyst%2Fp6-Algorithm-Tarjan/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/finanalyst%2Fp6-Algorithm-Tarjan/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/finanalyst","download_url":"https://codeload.github.com/finanalyst/p6-Algorithm-Tarjan/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/finanalyst%2Fp6-Algorithm-Tarjan/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29848637,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-25T22:37:40.667Z","status":"online","status_checked_at":"2026-02-26T02:00:06.774Z","response_time":89,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-07T14:01:11.633Z","updated_at":"2026-02-26T03:01:56.809Z","avatar_url":"https://github.com/finanalyst.png","language":"Perl 6","funding_links":[],"categories":[],"sub_categories":[],"readme":"# p6-Algorithm-Tarjan\n\nA perl6 implementation of Tarjan's algorithm for finding strongly connected components in a directed graph. \n\nMore information can be found at wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm.\n\nIf there is a cycle, then it will be within a strongly connected component. This implies that the absence of strongly connected components (other than a node with itself) means there are no cycles. It is possible there may be no cycles, but a strongly connected component may still exist (if I have interpreted the theory correctly). I was interested in the absence of cycles.\n\n```\nuse Algorithm::Tarjan;\n\nmy Algorithm::Tarjan $a .= new();\n\nmy %h;\n# code to fill %h node-\u003e[successor nodes]\n\n$a.init(%h);\nsay 'There are ' ~ $a.find-cycles() ~ ' cycle(s) in the input graph';\n```\nIf there is a need for the sets of strongly connected components, they can be retrieved from $a.strongly-connected (an array of node names).\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffinanalyst%2Fp6-algorithm-tarjan","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffinanalyst%2Fp6-algorithm-tarjan","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffinanalyst%2Fp6-algorithm-tarjan/lists"}