{"id":19453835,"url":"https://github.com/remi-choffat/s2-02","last_synced_at":"2025-09-10T16:40:24.336Z","repository":{"id":245244325,"uuid":"807969093","full_name":"remi-choffat/S2-02","owner":"remi-choffat","description":"SAÉ Exploration algorithmique d'un problème","archived":false,"fork":false,"pushed_at":"2024-06-01T09:24:42.000Z","size":11344,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-08T00:45:39.856Z","etag":null,"topics":["bellman-ford-algorithm","dijkstra-algorithm","graph-traversal-algorithms"],"latest_commit_sha":null,"homepage":"","language":"Java","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/remi-choffat.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":"2024-05-30T06:07:44.000Z","updated_at":"2024-06-20T07:06:51.000Z","dependencies_parsed_at":"2024-06-20T21:41:29.138Z","dependency_job_id":null,"html_url":"https://github.com/remi-choffat/S2-02","commit_stats":null,"previous_names":["remi-choffat/s2-02"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/remi-choffat%2FS2-02","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/remi-choffat%2FS2-02/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/remi-choffat%2FS2-02/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/remi-choffat%2FS2-02/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/remi-choffat","download_url":"https://codeload.github.com/remi-choffat/S2-02/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240645807,"owners_count":19834485,"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":["bellman-ford-algorithm","dijkstra-algorithm","graph-traversal-algorithms"],"created_at":"2024-11-10T17:06:27.618Z","updated_at":"2025-02-25T10:20:51.395Z","avatar_url":"https://github.com/remi-choffat.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# SAÉ Exploration algorithmique d'un problème\n\n### BUT Informatique - Semestre 2\n\n## Recherche de plus court chemin dans un graphe\n\n[Rémi Choffat](https://github.com/remi-choffat) et [Mathieu Graff](https://github.com/Cesareuh)\n\n\u003e Étant donné un graphe orienté, composé de nœuds et d'arcs étiquetés par des coûts (ou poids) positifs, le problème du\n\u003e plus court chemin consiste à trouver un chemin d’un\n\u003e nœud à un autre de sorte que la somme des coûts soit minimale. Le but de cette SAÉ est d'implémenter des solutions\n\u003e algorithmiques pour ce problème.\n\n[Voir le rapport](https://github.com/remi-choffat/S2-02/blob/main/rapport_S2-02.pdf)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fremi-choffat%2Fs2-02","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fremi-choffat%2Fs2-02","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fremi-choffat%2Fs2-02/lists"}