{"id":21427153,"url":"https://github.com/anders-wind/graph_mapper","last_synced_at":"2025-03-16T21:20:54.850Z","repository":{"id":239501300,"uuid":"799698018","full_name":"anders-wind/graph_mapper","owner":"anders-wind","description":"Mapping out all small sized graphs, problems and their solutions","archived":false,"fork":false,"pushed_at":"2024-06-02T20:50:11.000Z","size":93,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-23T07:45:14.531Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C++","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/anders-wind.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","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":"2024-05-12T22:34:18.000Z","updated_at":"2024-06-02T20:50:13.000Z","dependencies_parsed_at":"2024-05-12T23:28:50.260Z","dependency_job_id":"d856212c-151b-46ed-be60-c5af42a11ccc","html_url":"https://github.com/anders-wind/graph_mapper","commit_stats":null,"previous_names":["anders-wind/graph_mapper"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anders-wind%2Fgraph_mapper","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anders-wind%2Fgraph_mapper/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anders-wind%2Fgraph_mapper/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anders-wind%2Fgraph_mapper/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anders-wind","download_url":"https://codeload.github.com/anders-wind/graph_mapper/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243933428,"owners_count":20370989,"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-11-22T21:44:05.111Z","updated_at":"2025-03-16T21:20:54.826Z","avatar_url":"https://github.com/anders-wind.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# graph_mapper\n\nThis is the graph_mapper project. The intend is to solve different problems on all graphs up to a limited size (most likely N=9) and store their dataset.\n\nSee data/ folder for the currently existing results.\n\n## Problems\n\n- [x] minimum vertext cover\n- [x] maximum independent set\n- [x] maximum clique\n- [ ] clique cover\n- [ ] k-coloring (minimum)\n- [ ] longest path (and hamiltonian path)\n- [ ] longest cycle (and hamiltonian cycle)\n- [ ] Feedback node set\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanders-wind%2Fgraph_mapper","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanders-wind%2Fgraph_mapper","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanders-wind%2Fgraph_mapper/lists"}