{"id":20497253,"url":"https://github.com/melikechan/competitive-libs","last_synced_at":"2025-03-05T18:54:29.279Z","repository":{"id":175823723,"uuid":"654519011","full_name":"melikechan/competitive-libs","owner":"melikechan","description":"melikechan's competitive programming library","archived":false,"fork":false,"pushed_at":"2024-07-26T10:11:13.000Z","size":42,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-16T06:26:22.252Z","etag":null,"topics":["competitive-programming","competitive-programming-algorithms","cp-algorithms","cpp"],"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/melikechan.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-06-16T09:57:37.000Z","updated_at":"2024-07-26T10:11:16.000Z","dependencies_parsed_at":"2025-01-16T06:35:55.554Z","dependency_job_id":null,"html_url":"https://github.com/melikechan/competitive-libs","commit_stats":null,"previous_names":["melikechan/competitive-libs"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/melikechan%2Fcompetitive-libs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/melikechan%2Fcompetitive-libs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/melikechan%2Fcompetitive-libs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/melikechan%2Fcompetitive-libs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/melikechan","download_url":"https://codeload.github.com/melikechan/competitive-libs/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242087891,"owners_count":20069722,"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":["competitive-programming","competitive-programming-algorithms","cp-algorithms","cpp"],"created_at":"2024-11-15T18:10:30.542Z","updated_at":"2025-03-05T18:54:29.224Z","avatar_url":"https://github.com/melikechan.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# melikechan's competitive programming library\n\nMy competitive programming library, written in _mostly C++._\n\n## Contents\n\n### Algorithms\n\n- [Math](libs/math)\n  - [Combinatorics](libs/math/combinatorics)\n  - [Modular Arithmetic](libs/math/modular_arithmetic)\n  - [Sieve and Prime Factorization](libs/math/sieve_and_factorization)\n    - [Factorization](libs/math/sieve_and_factorization/factorization)\n    - [Sieve](libs/math/sieve_and_factorization/sieve)\n  - [Factorial](libs/math/factorial.cpp)\n  - [Fast Exponentiation](libs/math/fast_exponentiation.cpp)\n\n- [Graph Algorithms](libs/graph)\n  - [Traversal](libs/graph/traversal)\n    - [Breadth-First Search](libs/graph/traversal/bfs.cpp)\n    - [Depth-First Search](libs/graph/traversal/dfs.cpp)\n    - [Flood Fill](libs/graph/traversal/flood_fill.cpp)\n    - [BFS in a Grid](libs/graph/traversal/grid_bfs.cpp)\n  - [Shortest Path](libs/graph/shortest_path)\n    - [0-1 BFS](libs/graph/shortest_path/zeroone_bfs.cpp)\n  - [Minimum Spanning Tree](libs/graph/mst)\n    - [Kruskal's Algorithm](libs/graph/mst/kruskal.cpp)\n    - [Prim's Algorithm](libs/graph/mst/prim.cpp)\n  - [Utilities](libs/graph/utils)\n    - [Bipartite Check](libs/graph/utils/bipartite.cpp)\n    - [Cycle Check in an Undirected Graph](libs/graph/utils/cycle_check.cpp)\n    - [Cycle Check in a Directed Graph](libs/graph/utils/cycle_check_directed.cpp)\n    - [Topological Sort](libs/graph/utils/topological_sort.cpp)\n\n### Data Structures\n\n- [Graphs](libs/graph)\n  - [Graph Representation](libs/graph/graph_basic.cpp)\n  - [Disjoint Set Union](libs/graph/dsu)\n    - [DSU (regular implementation)](libs/graph/dsu/dsu.cpp)\n    - [DSU with one array](libs/graph/dsu/dsu_one_array.cpp)\n\n## Contributing\n\nIf you spot a bug or want to see another algorithm/data structure added, feel free to open an issue or a pull request. I'm always open to suggestions!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmelikechan%2Fcompetitive-libs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmelikechan%2Fcompetitive-libs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmelikechan%2Fcompetitive-libs/lists"}