{"id":25031788,"url":"https://github.com/centuriontheman/graphalgorithms","last_synced_at":"2025-10-15T08:08:40.736Z","repository":{"id":165062984,"uuid":"640456035","full_name":"CenturionTheMan/GraphAlgorithms","owner":"CenturionTheMan","description":"The project implements selected graph algorithms and measures their time complexity.","archived":false,"fork":false,"pushed_at":"2023-05-30T18:40:58.000Z","size":4477,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-30T19:33:26.164Z","etag":null,"topics":["cpp","cpp-programming","graphs","time-complexity","time-complexity-analysis","time-complexity-comparison","university","university-project"],"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/CenturionTheMan.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-05-14T06:31:21.000Z","updated_at":"2023-06-04T09:48:49.000Z","dependencies_parsed_at":null,"dependency_job_id":"74cf13bd-4b52-44fb-86ae-4b76a8b6be48","html_url":"https://github.com/CenturionTheMan/GraphAlgorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/CenturionTheMan/GraphAlgorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CenturionTheMan%2FGraphAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CenturionTheMan%2FGraphAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CenturionTheMan%2FGraphAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CenturionTheMan%2FGraphAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/CenturionTheMan","download_url":"https://codeload.github.com/CenturionTheMan/GraphAlgorithms/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CenturionTheMan%2FGraphAlgorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279060163,"owners_count":26095102,"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-15T02:00:07.814Z","response_time":56,"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":["cpp","cpp-programming","graphs","time-complexity","time-complexity-analysis","time-complexity-comparison","university","university-project"],"created_at":"2025-02-05T22:44:55.743Z","updated_at":"2025-10-15T08:08:40.683Z","avatar_url":"https://github.com/CenturionTheMan.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graph Algorithms\nThis project was made for university purposes.\n\nIt implements the following graph representations:\n* Adjacency Matrix\n* Adjacency List\n\nThese representations are later used for:\n* MST algorithms:\n  * Prim's algorithm\n  * Kruskal's algorithm\n* Shortest path algorithms:\n  * Dijkstra's algorithm\n  * Bellman–Ford algorithm\n\nIt also conducts time tests in order to analyze the time complexity of each graph/algorithm combination.\n\nThe results are presented in Polish in the report.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcenturiontheman%2Fgraphalgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcenturiontheman%2Fgraphalgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcenturiontheman%2Fgraphalgorithms/lists"}