{"adoption": {"forks": 335, "observed_at": "2026-08-28T04:07:18.878042+00:00", "stars": 2770}, "canonical_url": "https://ross.abutalabs.com/products/data-structures-and-algorithms", "card": {"archived": false, "artifact_type": "library", "description": "Data Structures and Algorithms implementation in Go", "domain": ["programming-languages", "tutorials"], "enriched": true, "function": ["parser", "developer-tools"], "health_score": 20, "homepage": null, "language": "Go", "license": "MIT", "license_family": "permissive", "maturity": "maintenance", "member_repos": ["ua-nick/Data-Structures-and-Algorithms"], "name": "ua-nick/Data-Structures-and-Algorithms", "platform": ["go", "cross-platform"], "pushed_at": "2024-05-10T19:40:23+00:00", "repo": "ua-nick/Data-Structures-and-Algorithms", "stars": 2770, "tags": ["data-structures", "sorting-algorithms", "searching-algorithms", "go", "educational", "copy-paste-friendly", "algorithms"], "topics": ["datastructures", "algorithms", "algorithms-datastructures", "algorithms-and-data-structures", "golang", "go", "algorithm", "data-structures"], "urls": [], "use_cases": ["learn how classic data structures are implemented in Go", "copy a merge sort or binary search implementation into my project", "study reference code for linked lists, stacks, and queues", "find a clean Go example of a hash table or trie", "compare implementations of searching and sorting algorithms", "prepare for coding interviews with readable algorithm code"], "what_it_is": "A Go implementation of common data structures (linked lists, stacks, queues, binary trees, hash tables, tries) and classic searching and sorting algorithms. It is explicitly designed as reference code to copy and adapt rather than to import as a dependency.", "when_to_avoid": ["you need a production-grade, battle-tested data structures library to import", "you require advanced structures like graphs, heaps, or balanced trees", "you expect frequent updates or long-term maintenance"], "when_to_choose": ["you want readable, idiomatic Go source to copy into your own codebase", "you are learning or teaching data structures and algorithms", "you need a small algorithm snippet without pulling in a dependency"]}, "data_as_of": "2026-08-30T08:39:29.467469+00:00", "members": [{"path": "/products/data-structures-and-algorithms", "repo": "ua-nick/Data-Structures-and-Algorithms", "role": "main", "score": 32}], "provenance": {"archived": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "artifact_type": {"confidence": null, "enriched_at": "2026-08-30T08:16:41.088401+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "0738db309e7c5ca320e968120fa22d72459adaef6bee90258de56005c48724ff", "fetched_at": "2026-08-28T04:07:18.878042+00:00", "kind": "readme", "missing": false, "url": "https://github.com/ua-nick/Data-Structures-and-Algorithms"}], "taxonomy_version": 1}, "description": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "domain": {"confidence": null, "enriched_at": "2026-08-30T08:16:41.088401+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "0738db309e7c5ca320e968120fa22d72459adaef6bee90258de56005c48724ff", "fetched_at": "2026-08-28T04:07:18.878042+00:00", "kind": "readme", "missing": false, "url": "https://github.com/ua-nick/Data-Structures-and-Algorithms"}], "taxonomy_version": 1}, "enriched": {"inputs": [], "kind": "computed", "method": "enrichment_status"}, "function": {"confidence": null, "enriched_at": "2026-08-30T08:16:41.088401+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "0738db309e7c5ca320e968120fa22d72459adaef6bee90258de56005c48724ff", "fetched_at": "2026-08-28T04:07:18.878042+00:00", "kind": "readme", "missing": false, "url": "https://github.com/ua-nick/Data-Structures-and-Algorithms"}], "taxonomy_version": 1}, "health_score": {"inputs": ["days_since_push", "days_since_release", "archived"], "kind": "computed", "method": "health_v1"}, "homepage": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "language": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "license": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "license_family": {"inputs": ["license"], "kind": "computed", "method": "license_family"}, "maturity": {"confidence": null, "enriched_at": "2026-08-30T08:16:41.088401+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "0738db309e7c5ca320e968120fa22d72459adaef6bee90258de56005c48724ff", "fetched_at": "2026-08-28T04:07:18.878042+00:00", "kind": "readme", "missing": false, "url": "https://github.com/ua-nick/Data-Structures-and-Algorithms"}], "taxonomy_version": 1}, "member_repos": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "name": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "platform": {"confidence": null, "enriched_at": "2026-08-30T08:16:41.088401+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "0738db309e7c5ca320e968120fa22d72459adaef6bee90258de56005c48724ff", "fetched_at": "2026-08-28T04:07:18.878042+00:00", "kind": "readme", "missing": false, "url": "https://github.com/ua-nick/Data-Structures-and-Algorithms"}], "taxonomy_version": 1}, "pushed_at": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "repo": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "stars": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "tags": {"confidence": null, "enriched_at": "2026-08-30T08:16:41.088401+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "0738db309e7c5ca320e968120fa22d72459adaef6bee90258de56005c48724ff", "fetched_at": "2026-08-28T04:07:18.878042+00:00", "kind": "readme", "missing": false, "url": "https://github.com/ua-nick/Data-Structures-and-Algorithms"}], "taxonomy_version": 1}, "topics": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "urls": {"kind": "observed", "observed_at": "2026-08-28T04:07:18.878042+00:00", "source": "github"}, "use_cases": {"confidence": null, "enriched_at": "2026-08-30T08:16:41.088401+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "0738db309e7c5ca320e968120fa22d72459adaef6bee90258de56005c48724ff", "fetched_at": "2026-08-28T04:07:18.878042+00:00", "kind": "readme", "missing": false, "url": "https://github.com/ua-nick/Data-Structures-and-Algorithms"}], "taxonomy_version": 1}, "what_it_is": {"confidence": null, "enriched_at": "2026-08-30T08:16:41.088401+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "0738db309e7c5ca320e968120fa22d72459adaef6bee90258de56005c48724ff", "fetched_at": "2026-08-28T04:07:18.878042+00:00", "kind": "readme", "missing": false, "url": "https://github.com/ua-nick/Data-Structures-and-Algorithms"}], "taxonomy_version": 1}, "when_to_avoid": {"confidence": null, "enriched_at": "2026-08-30T08:16:41.088401+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "0738db309e7c5ca320e968120fa22d72459adaef6bee90258de56005c48724ff", "fetched_at": "2026-08-28T04:07:18.878042+00:00", "kind": "readme", "missing": false, "url": "https://github.com/ua-nick/Data-Structures-and-Algorithms"}], "taxonomy_version": 1}, "when_to_choose": {"confidence": null, "enriched_at": "2026-08-30T08:16:41.088401+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "0738db309e7c5ca320e968120fa22d72459adaef6bee90258de56005c48724ff", "fetched_at": "2026-08-28T04:07:18.878042+00:00", "kind": "readme", "missing": false, "url": "https://github.com/ua-nick/Data-Structures-and-Algorithms"}], "taxonomy_version": 1}}, "score": {"components": {"activity": 0, "longevity": 100, "rhythm": 35}, "computed_at": "2026-09-03T02:20:16.233290+00:00", "flags": ["no_releases"], "formula": "round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10)", "inputs": {"age_days": 3077, "days_push": 845, "days_rel": null, "gap_med": null, "n_releases_24m": 0}, "score": 32, "version": 2}, "staleness": {"enrichment_outdated": false, "low_confidence": false, "scrape_days": 9, "stale_scrape": false}}