{"id":43524783,"url":"https://github.com/dustin-ward/comp-lib-go","last_synced_at":"2026-02-03T14:37:32.666Z","repository":{"id":212994862,"uuid":"732777059","full_name":"dustin-ward/comp-lib-go","owner":"dustin-ward","description":"Competitive Programming Library for Go","archived":false,"fork":false,"pushed_at":"2023-12-28T03:46:56.000Z","size":14,"stargazers_count":0,"open_issues_count":9,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-04-16T00:46:26.136Z","etag":null,"topics":["algorithms","competitive-programming","competitive-programming-contests","data-structures","golang","golang-library"],"latest_commit_sha":null,"homepage":"","language":"Go","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/dustin-ward.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}},"created_at":"2023-12-17T19:43:12.000Z","updated_at":"2023-12-18T03:52:28.000Z","dependencies_parsed_at":"2024-01-01T08:13:43.721Z","dependency_job_id":"d1f34479-7a3d-4331-a196-693d863adf15","html_url":"https://github.com/dustin-ward/comp-lib-go","commit_stats":{"total_commits":19,"total_committers":1,"mean_commits":19.0,"dds":0.0,"last_synced_commit":"ead10068443e22e8057514252be748fa002f8746"},"previous_names":["dustin-ward/comp-lib-go"],"tags_count":4,"template":false,"template_full_name":null,"purl":"pkg:github/dustin-ward/comp-lib-go","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dustin-ward%2Fcomp-lib-go","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dustin-ward%2Fcomp-lib-go/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dustin-ward%2Fcomp-lib-go/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dustin-ward%2Fcomp-lib-go/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dustin-ward","download_url":"https://codeload.github.com/dustin-ward/comp-lib-go/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dustin-ward%2Fcomp-lib-go/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29047566,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-03T10:09:22.136Z","status":"ssl_error","status_checked_at":"2026-02-03T10:09:16.814Z","response_time":96,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithms","competitive-programming","competitive-programming-contests","data-structures","golang","golang-library"],"created_at":"2026-02-03T14:37:31.588Z","updated_at":"2026-02-03T14:37:32.645Z","avatar_url":"https://github.com/dustin-ward.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Competitive Programming Library for Go\n\nThis is a collection of algorithms and data structures written in Go.\n\nThey might not all be fast enough for competitive programming platforms like Kattis or CodeForces, \nbut they are good enough for Advent of Code (What I needed them for)\n\n## Algorithms / Routines\n\n### Binomial Coefficients\n_binom.go_\n\n`Binom(n, k int) int` O(k)\n\n### Dijkstra's\n_dijkstra.go_\n\n`Dijkstra(g *GraphMtx, src int) []int` O(E\\*log(V))\n\n`Dijkstra_Sparse(g *GraphLst, src int) []int` O(V\u003csup\u003e2\u003c/sup\u003e)\n\n## Data Structures\n\n### GraphLst (Adjacency List)\n_graph.go_\n\n`NewGraphLst(N int) *GraphLst` \n\n`(g *GraphLst) AddEdge(u, v, w int)` O(1) - _O(N) worst case_\n\n### GraphMtx (Adjacency Matrix)\n_graph.go_\n\n`NewGraphMtx(N int) *GraphMtx` \n\n`(g *GraphMtx) AddEdge(u, v, w int)` O(1)\n\n### Priority Queue\n_priority\\_queue.go_\n\n`NewPQ[T](beforeFunc func(a, b T)bool) *priority_queue[T]`\n\n`(pq *priority_queue) Push(x T)` O(log(N))\n\n`(pq *priority_queue) Pop(x T) T` O(log(N))\n\n`(pq *priority_queue) Top() T` O(1)\n\n`(pq *priority_queue) Len() int` O(1)\n\n`(pq *priority_queue) Empty() bool` O(1)\n\n### Union Find\n\n`NewUnionFind(N int) *unionFind` O(N)\n\n`(uf *unionFind) Find(x int) int` O(log(N))\n\n`(uf *unionFind) Merge(x int) bool` O(log(N))\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdustin-ward%2Fcomp-lib-go","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdustin-ward%2Fcomp-lib-go","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdustin-ward%2Fcomp-lib-go/lists"}