{"id":22880770,"url":"https://github.com/dantasl/graphs","last_synced_at":"2025-03-31T15:48:20.136Z","repository":{"id":70056413,"uuid":"191007572","full_name":"dantasl/Graphs","owner":"dantasl","description":"Developing the final project of 2019.1 class of Graphs, at IMD/UFRN. Implementing DSATUR's algorithm.","archived":false,"fork":false,"pushed_at":"2019-06-18T12:29:09.000Z","size":2020,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-02-06T21:24:27.181Z","etag":null,"topics":["coloring-graph","computer-science","dsatur-algorithm","graphs"],"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/dantasl.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":"2019-06-09T13:06:46.000Z","updated_at":"2019-06-18T12:29:11.000Z","dependencies_parsed_at":"2023-05-18T02:02:36.600Z","dependency_job_id":null,"html_url":"https://github.com/dantasl/Graphs","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dantasl%2FGraphs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dantasl%2FGraphs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dantasl%2FGraphs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dantasl%2FGraphs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dantasl","download_url":"https://codeload.github.com/dantasl/Graphs/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246491412,"owners_count":20786177,"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":["coloring-graph","computer-science","dsatur-algorithm","graphs"],"created_at":"2024-12-13T17:27:10.226Z","updated_at":"2025-03-31T15:48:20.116Z","avatar_url":"https://github.com/dantasl.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graphs\nDeveloping the final project of 2019.1 class of Graphs, at IMD/UFRN. Implementing DSATUR's algorithm.\n\n## Compiling\n\nThe code is compiled using a simple Makefile, configured to run C++11. You can compile this project with:\n\n```make```\n\n## Running\n\nTo run this project, you need to provide a valid xml graph file. You can find samples of the test cases inside ```test_cases``` directory.\n\nAn example of this is:\n\n```./graphs.out test_cases/test_1_1000_patients.xml```\n\nWhere ```graphs.out``` is the executable for this project generated after compiling and ```test_cases/test_1_1000_patients.xml``` is the path to the graph file.\nAfter running, there will be a new file inside ```results``` called ```result_dsatur.txt```. This file is the log of the execution.\n\n### This is a work in progress. There's still some optmizations to be made.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdantasl%2Fgraphs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdantasl%2Fgraphs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdantasl%2Fgraphs/lists"}