arnauddri/algorithms resource
Algorithms & Data Structures in Go observed · 2026-08-28
Health v2 · maintenance only
32/100
- Activity 0
- Release rhythm 35
- Longevity 100
Flags: no_releases no_license
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 4247
- days_rel: n/a
- days_push: 2036
- n_releases_24m: 0
Adoption not part of the score
1848 stars · 263 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
A collection of classic algorithms and data structures implemented in Go, including trees, graphs, heaps, sorting, and shortest-path algorithms. It is explicitly a learning exercise and not intended for production use.
Use cases
- learn classic data structures in Go
- study graph algorithms like Dijkstra and Kosaraju
- reference implementations of heaps and priority queues
- prepare for coding interviews with Go examples
- understand sorting and searching algorithm implementations
When to choose
- you want readable Go examples of fundamental CS concepts
- you are learning Go and algorithms at the same time
When to avoid
- you need production-ready, well-maintained data structure libraries
- you need a license-cleared dependency for a commercial project
Facets
learning-resource · maturity abandoned
developer-tools education programming-languages go data-structures algorithms go educational graph-algorithms sorting
1 source
- readme: https://github.com/arnauddri/algorithms · fetched 2026-08-28 · c4e29d7d6925
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| arnauddri/algorithms | main | 32 |
For agents
markdown · JSON · MCP: product_card(name="arnauddri/algorithms")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem