{"id":22450210,"url":"https://github.com/aldaronlau/gt_algorithms","last_synced_at":"2025-08-01T23:31:23.790Z","repository":{"id":52441915,"uuid":"127471842","full_name":"AldaronLau/gt_algorithms","owner":"AldaronLau","description":"Graph theory algorithms in Rust.","archived":false,"fork":false,"pushed_at":"2023-05-26T22:43:59.000Z","size":96,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":4,"default_branch":"master","last_synced_at":"2023-05-26T23:23:52.412Z","etag":null,"topics":["edges","graph-theory","gt-algorithms","rayon","rust-library","simd"],"latest_commit_sha":null,"homepage":"","language":"Rust","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/AldaronLau.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":"2018-03-30T20:49:31.000Z","updated_at":"2023-05-26T22:44:13.000Z","dependencies_parsed_at":"2023-01-18T04:35:10.806Z","dependency_job_id":null,"html_url":"https://github.com/AldaronLau/gt_algorithms","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AldaronLau%2Fgt_algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AldaronLau%2Fgt_algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AldaronLau%2Fgt_algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AldaronLau%2Fgt_algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AldaronLau","download_url":"https://codeload.github.com/AldaronLau/gt_algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":228413976,"owners_count":17915929,"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":["edges","graph-theory","gt-algorithms","rayon","rust-library","simd"],"created_at":"2024-12-06T05:13:50.508Z","updated_at":"2024-12-06T05:13:51.350Z","avatar_url":"https://github.com/AldaronLau.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graph Theory Algorithms ( gt_algorithms )\nGraph theory algorithms in Rust.\n\n## Graph Format\nThe graph format stores a list of colors.  The file is a sequence of characters: `'1'` for `RED`, and `'0'` for `BLUE`.  Take for instance, a 4-vertex graph with vertices 0, 1, 2 and 3.  The order is specified below.\n```\n1~0 // Add 2nd Vertex (1 edge)\n2~0 // Add 3rd Vertex (2 edges)\n2~1\n3~0 // Add 4th Vertex (3 edges)\n3~1\n3~2\n```\n\nExample coloring file for K4:\n```\n110010\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faldaronlau%2Fgt_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faldaronlau%2Fgt_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faldaronlau%2Fgt_algorithms/lists"}