{"id":25435777,"url":"https://github.com/quentin18/dfs","last_synced_at":"2025-10-29T04:20:44.208Z","repository":{"id":112299295,"uuid":"272009947","full_name":"Quentin18/DFS","owner":"Quentin18","description":"Depth-First Search algorithm \u0026 applications","archived":false,"fork":false,"pushed_at":"2020-06-13T13:06:34.000Z","size":735,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-17T07:35:46.708Z","etag":null,"topics":["c","dfs"],"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/Quentin18.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":"2020-06-13T13:02:55.000Z","updated_at":"2020-07-06T17:41:16.000Z","dependencies_parsed_at":"2023-06-03T12:00:40.219Z","dependency_job_id":null,"html_url":"https://github.com/Quentin18/DFS","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/Quentin18%2FDFS","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Quentin18%2FDFS/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Quentin18%2FDFS/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Quentin18%2FDFS/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Quentin18","download_url":"https://codeload.github.com/Quentin18/DFS/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254254037,"owners_count":22039792,"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":["c","dfs"],"created_at":"2025-02-17T07:31:59.865Z","updated_at":"2025-10-29T04:20:44.203Z","avatar_url":"https://github.com/Quentin18.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DFS\nAlgorithme de parcours en profondeur et ses applications en C\n\n## Installation\nClonez le projet :\n```bash\ngit clone https://github.com/Quentin18/DFS.git\n```\n\nGénérez la librairie statique *libgraph* :\n```bash\ncd src\nmake\n```\n\nGénérez l'exécutable *graphAnalyzer* :\n```bash\ncd ..\nmake\n```\n\n## Utilisation\nL'exécutable *graphAnalyzer* établit différentes analyses sur des graphes au format *.txt* et génère des fichiers *.dot*. Pour l'utiliser :\n```bash\n./graphAnalyzer \u003cnomFichier\u003e \u003corientation\u003e\n```\nOù :\n\n- *nomFichier* correspond au nom du fichier *.txt* à analyser sans l'extension *.txt*\n- *orientation* vaut 1 si le graphe est orienté et 0 sinon\n\n**Exemple :**\n```bash\n./graphAnalyzer graphs/graph-1 0\n```\n\n## Graphes\nVous trouverez différents graphes au format *.txt* dans le répertoire *graphs*. Par convention, les fichiers nommés *digraph* sont des graphes orientés et *graph* sont non orientés. Ces fichiers sont organisés comme suit :\n\n- Ligne 1 : nombre de sommets\n- Ligne 2 : nombre d'arêtes\n- Lignes suivantes : arêtes entre deux sommets\n\nDans le cas où le graphe est orienté, l'ordre des deux sommets est important.\n\n## Fonctionnalités\nVoici la liste des fonctionnalités de la librairie *libgraph* :\n\n* Exportation d'un graphe au format *.dot*\n* Inversion d'un graphe orienté\n* Parcours DFS avec visualisation en *.dot*\n* Connexité et composantes fortement connexes\n* Détermination d'une orientation forte\n\n## Exemples\n**Graphe orienté : digraph-1**\n\n* Graphe au format *.dot* :\n\n![](https://github.com/Quentin18/DFS/blob/master/img/digraph-1.png)\n\n* Graphe inverse :\n\n![](https://github.com/Quentin18/DFS/blob/master/img/digraph-1-inv.png)\n\n* Parcours DFS :\n\n![](https://github.com/Quentin18/DFS/blob/master/img/digraph-1-dfs.png)\n\n* Composantes fortement connexes :\n\n![](https://github.com/Quentin18/DFS/blob/master/img/digraph-1-cfc.png)\n\n**Graphe non orienté : graph-k**\n\n* Graphe au format *.dot* :\n\n![](https://github.com/Quentin18/DFS/blob/master/img/graph-k.png)\n\n* Détermination d'une orientation forte :\n\n![](https://github.com/Quentin18/DFS/blob/master/img/graph-k-ort.png)\n\n* Vérification de la forte connexité avec les composantes fortement connexes :\n\n![](https://github.com/Quentin18/DFS/blob/master/img/graph-k-cfc.png)\n\n## Exportation des .dot\nLes fichiers *.dot* peuvent être exportés grâce à *graphviz* aux formats *.png*, *.svg* et *.eps*. Pour cela, voici les commandes :\n\n```bash\ndot -Tpng filename.dot -o filename.png\ndot -Tsvg filename.dot -o filename.svg\ndot -Tps filename.dot -o filename.eps\n```\n\n## Contact\nQuentin Deschamps: quentindeschamps18@gmail.com\n\n## Licence\n[MIT](https://choosealicense.com/licenses/mit/)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fquentin18%2Fdfs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fquentin18%2Fdfs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fquentin18%2Fdfs/lists"}