{"id":26671066,"url":"https://github.com/maxime-cllt/dsatur","last_synced_at":"2025-10-09T02:09:44.132Z","repository":{"id":162839712,"uuid":"617456359","full_name":"Maxime-Cllt/DSATUR","owner":"Maxime-Cllt","description":"Projet de l'UE graphe en L3","archived":false,"fork":false,"pushed_at":"2023-11-02T12:51:07.000Z","size":109,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-09T02:05:45.818Z","etag":null,"topics":["algorithms","cpp","dsatur","graph"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Maxime-Cllt.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2023-03-22T12:40:07.000Z","updated_at":"2025-03-25T16:48:21.000Z","dependencies_parsed_at":"2024-12-03T18:14:02.790Z","dependency_job_id":"8ebe3522-5294-4f12-a6bf-90ee3358e428","html_url":"https://github.com/Maxime-Cllt/DSATUR","commit_stats":null,"previous_names":["maxime-cllt/graphe","maxime-cllt/dsatur"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Maxime-Cllt/DSATUR","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Maxime-Cllt%2FDSATUR","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Maxime-Cllt%2FDSATUR/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Maxime-Cllt%2FDSATUR/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Maxime-Cllt%2FDSATUR/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Maxime-Cllt","download_url":"https://codeload.github.com/Maxime-Cllt/DSATUR/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Maxime-Cllt%2FDSATUR/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279000773,"owners_count":26082906,"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","status":"online","status_checked_at":"2025-10-09T02:00:07.460Z","response_time":59,"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":["algorithms","cpp","dsatur","graph"],"created_at":"2025-03-25T23:29:39.644Z","updated_at":"2025-10-09T02:09:44.089Z","avatar_url":"https://github.com/Maxime-Cllt.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Projet de Graphes - DSATUR\n\nCe projet a été réalisé dans le cadre d'un cours sur les graphes. Il vise à explorer l'utilisation de l'algorithme DSATUR pour la coloration de graphes.\n\n## Présentation du projet\n\nL'objectif de ce projet était de mettre en pratique les concepts appris en cours sur les graphes en utilisant l'algorithme DSATUR pour la coloration de graphes. Nous avons implémenté cet algorithme en C++ en utilisant des tableaux.\n\n## Fonctionnement de l'algorithme DSATUR\nL'algorithme DSATUR (Degree of the Smallest Adjacent Color plus Saturation) est un algorithme de coloration de graphes qui consiste à choisir à chaque étape le sommet ayant le plus grand degré et la saturation la plus élevée. La saturation d'un sommet est le nombre de couleurs différentes utilisées par ses voisins. Cet algorithme a été proposé par Brélaz en 1979.\n\n\u003ch2\u003eExecution du code\u003c/h2\u003e\n\nPour exécuter le programme avec les meilleures performances, compiler le fichier \"Projet.cpp\" en utilisant les commandes suivantes :\n\n````\ng++ -o exec -O3 Projet.cpp\n````\n````\n./exec \n````\n## Conclusion\nCe projet nous a permis de mieux comprendre le fonctionnement des graphes et de l'algorithme DSATUR en particulier. Nous avons également appris à implémenter cet algorithme en utilisant des tableaux en C++.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaxime-cllt%2Fdsatur","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmaxime-cllt%2Fdsatur","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaxime-cllt%2Fdsatur/lists"}