{"id":26958862,"url":"https://github.com/thergh/aod","last_synced_at":"2025-09-11T04:40:06.105Z","repository":{"id":279699949,"uuid":"880739872","full_name":"thergh/AOD","owner":"thergh","description":"Algorithms for discrete optimisation","archived":false,"fork":false,"pushed_at":"2025-02-26T22:55:47.000Z","size":24802,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-05T08:10:17.351Z","etag":null,"topics":["discrete-optimization","shortest-path"],"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/thergh.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-10-30T09:13:31.000Z","updated_at":"2025-02-26T22:55:50.000Z","dependencies_parsed_at":"2025-02-26T23:32:53.743Z","dependency_job_id":"a9ff15b7-3f61-47db-92e8-03dc51570d19","html_url":"https://github.com/thergh/AOD","commit_stats":null,"previous_names":["thergh/aod"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/thergh/AOD","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thergh%2FAOD","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thergh%2FAOD/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thergh%2FAOD/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thergh%2FAOD/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/thergh","download_url":"https://codeload.github.com/thergh/AOD/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thergh%2FAOD/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274578478,"owners_count":25310957,"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-09-11T02:00:13.660Z","response_time":74,"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":["discrete-optimization","shortest-path"],"created_at":"2025-04-03T04:32:26.312Z","updated_at":"2025-09-11T04:40:06.050Z","avatar_url":"https://github.com/thergh.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"### Algorithms for discrete optimisation\n\n### Lab1\nImplementation of common graph algorithms: BFS, DFS, checking if a graph is bipartite, finding strongly connected components of a graph, topologically sorting a graph.\n\n### Lab2\nModeling optimisation problems in Julia language for a solver.\n\n### Lab3\nImplementing and testing three versions of shortest path algorithms: Dijkstra, Dial and Radix. This exercise originated as a DIMACS programming challange.\n\n### Lab4\nFinding a maximum flow in a n-dimensional hypercube graph. Finding maximum matching in a bipartite graph.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthergh%2Faod","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthergh%2Faod","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthergh%2Faod/lists"}