{"id":18952197,"url":"https://github.com/lastaapps/ctu-ag2-progtest","last_synced_at":"2025-07-09T07:39:38.308Z","repository":{"id":178057686,"uuid":"612595177","full_name":"Lastaapps/ctu-ag2-progtest","owner":"Lastaapps","description":"My solutions for the problems given in the Algorithms and Graphs subject at CTU FIT in 2022/2023.","archived":false,"fork":false,"pushed_at":"2023-07-02T11:47:52.000Z","size":743,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-02T01:16:11.099Z","etag":null,"topics":["ctu","ctu-fit"],"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/Lastaapps.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-11T12:21:13.000Z","updated_at":"2023-07-02T11:48:37.000Z","dependencies_parsed_at":null,"dependency_job_id":"8ba93dd0-69fb-45bd-ad01-6374806afb47","html_url":"https://github.com/Lastaapps/ctu-ag2-progtest","commit_stats":null,"previous_names":["lastaapps/ctu-ag2-progtest"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Lastaapps/ctu-ag2-progtest","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Lastaapps%2Fctu-ag2-progtest","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Lastaapps%2Fctu-ag2-progtest/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Lastaapps%2Fctu-ag2-progtest/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Lastaapps%2Fctu-ag2-progtest/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Lastaapps","download_url":"https://codeload.github.com/Lastaapps/ctu-ag2-progtest/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Lastaapps%2Fctu-ag2-progtest/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":264415097,"owners_count":23604542,"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":["ctu","ctu-fit"],"created_at":"2024-11-08T13:31:30.653Z","updated_at":"2025-07-09T07:39:38.297Z","avatar_url":"https://github.com/Lastaapps.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# BI-AG2\n\nThese are my solutions for the problems given\nin the Algorithms and Graphs 2 subject at CTU FIT in 2022/2023.\nBoth were the fastest solutions submitted in that semester.\n\n## hw01\nProblem of finding strongly connected components.\n\n## hw02\nFinding of the smallest cut in a flow network.\nImplemented using Ford-fulkerson (in fact Edmonds-Karp) algorithm,\nDinitz and Push–relabel (Goldberg) algoritm.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flastaapps%2Fctu-ag2-progtest","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flastaapps%2Fctu-ag2-progtest","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flastaapps%2Fctu-ag2-progtest/lists"}