{"id":19623893,"url":"https://github.com/msskowron/godatastructures","last_synced_at":"2026-06-13T11:32:08.394Z","repository":{"id":184052697,"uuid":"668810772","full_name":"MSSkowron/GoDataStructures","owner":"MSSkowron","description":"Collection of data structures implemented in Golang.","archived":false,"fork":false,"pushed_at":"2023-08-01T22:41:14.000Z","size":57,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-26T07:56:11.679Z","etag":null,"topics":["data-structures","go"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/MSSkowron.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-07-20T16:34:50.000Z","updated_at":"2023-08-01T22:35:54.000Z","dependencies_parsed_at":"2023-07-26T23:05:34.928Z","dependency_job_id":null,"html_url":"https://github.com/MSSkowron/GoDataStructures","commit_stats":null,"previous_names":["msskowron/godatastructuresandalgorithms","msskowron/godatastructures"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/MSSkowron/GoDataStructures","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MSSkowron%2FGoDataStructures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MSSkowron%2FGoDataStructures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MSSkowron%2FGoDataStructures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MSSkowron%2FGoDataStructures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MSSkowron","download_url":"https://codeload.github.com/MSSkowron/GoDataStructures/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MSSkowron%2FGoDataStructures/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34283389,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-13T02:00:06.617Z","response_time":62,"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":["data-structures","go"],"created_at":"2024-11-11T11:35:59.811Z","updated_at":"2026-06-13T11:32:08.379Z","avatar_url":"https://github.com/MSSkowron.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# GoDataStructures\n\nThis repository contains a comprehensive set of data structures implemented in the Go programming language. The majority of these data structures are designed to be generic, making them versatile and reusable in various scenarios.\n\n## Data Structures\n\nBelow is a list of the data structures available in this repository along with a brief description of each:\n\n- [**Stack**](./stack/): Last-in, first-out (LIFO) data structure, providing efficient push and pop operations. It's useful for managing elements in a sequential manner.\n- [**Queue**](./queue/): First-in, first-out (FIFO) data structure, offering efficient enqueue and dequeue operations. It's ideal for scenarios where elements need to be processed in the order they arrive.\n- [**Priority queue**](./priority_queue/): Priority-based data structure that ensures elements are dequeued based on their priority. It's beneficial for tasks requiring element processing based on priority levels.\n- [**Heap**](./heap/): Heap data structure, allowing quick access to the minimum or maximum element. It's valuable for tasks that involve managing elements based on their relative ordering.\n- [**Linked list**](./linked_list/): Linear data structure consisting of nodes linked together, enabling efficient insertions and deletions. It's useful for scenarios where elements are frequently added or removed.\n- [**Hash table**](./hash_table/): Associative data structure that enables efficient key-value pair lookups. It's well-suited for tasks requiring fast access to data based on unique keys.\n- [**Binary search tree**](./binary_search_tree/): Binary tree structure that maintains its elements in a sorted order, facilitating quick search and retrieval. It's advantageous for scenarios where fast data retrieval is crucial.\n- [**Graph**](./graph/): Versatile data structure used to represent connections between elements, enabling various graph-related algorithms. It's essential for solving problems involving interconnected data.\n- [**Trie**](./trie/): Efficient information retrieval data structure, particularly useful for dictionary-like operations. It's valuable for tasks involving efficient prefix-based searches.\n- [**Set**](./set/): Collection of unique elements, supporting set operations like union, intersection, and difference. It's beneficial for managing unique data and performing set-based calculations.\n\n## License\n\nThe project is available as open source under the terms of the MIT License.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmsskowron%2Fgodatastructures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmsskowron%2Fgodatastructures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmsskowron%2Fgodatastructures/lists"}