{"id":17299899,"url":"https://github.com/twmb/go-dgraph","last_synced_at":"2025-03-26T22:13:45.150Z","repository":{"id":57488702,"uuid":"202850714","full_name":"twmb/go-dgraph","owner":"twmb","description":"Provides the strong components (Tarjan's) algorithm for determining dependency ordering and cycles with slices.","archived":false,"fork":false,"pushed_at":"2019-08-17T08:18:59.000Z","size":8,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-01T03:43:15.107Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/twmb.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}},"created_at":"2019-08-17T07:36:16.000Z","updated_at":"2022-06-19T04:10:01.000Z","dependencies_parsed_at":"2022-08-29T15:02:01.887Z","dependency_job_id":null,"html_url":"https://github.com/twmb/go-dgraph","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/twmb%2Fgo-dgraph","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/twmb%2Fgo-dgraph/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/twmb%2Fgo-dgraph/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/twmb%2Fgo-dgraph/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/twmb","download_url":"https://codeload.github.com/twmb/go-dgraph/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245743435,"owners_count":20665093,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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-15T11:24:25.130Z","updated_at":"2025-03-26T22:13:45.084Z","avatar_url":"https://github.com/twmb.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"go-dgraph\n=========\n\nPackage `dgraph` provides a very simple directed graph with the sole purpose of\nreturning nodes and cycles in dependency order with the strongly connected\ncomponents (Tarjan's) algorithm.\n\nThe StrongComponents returns graph components in dependency order. If the graph\nhas no cycles, each component will have a single element. Otherwise, all nodes\nin a cycle are grouped into one \"strong\" component.\n\nDocumentation\n-------------\n\n[![GoDoc](https://godoc.org/github.com/twmb/go-dgraph?status.svg)](https://godoc.org/github.com/twmb/go-dgraph)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftwmb%2Fgo-dgraph","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftwmb%2Fgo-dgraph","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftwmb%2Fgo-dgraph/lists"}