{"id":23004498,"url":"https://github.com/kafkasl/golang-ads","last_synced_at":"2025-08-26T15:08:58.909Z","repository":{"id":70774185,"uuid":"128914809","full_name":"kafkasl/golang-ads","owner":"kafkasl","description":"Golang Advanced Data Structures","archived":false,"fork":false,"pushed_at":"2018-06-20T10:32:35.000Z","size":963,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-08T05:28:22.586Z","etag":null,"topics":["advanced-data-structures","frequent-itemsets","golang","path-compression","patricia-trie","skip-list","trie","trie-structure","union-find"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kafkasl.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-04-10T10:23:11.000Z","updated_at":"2021-01-26T18:19:53.000Z","dependencies_parsed_at":null,"dependency_job_id":"54c34eab-684a-4252-8fb5-77f5b741415e","html_url":"https://github.com/kafkasl/golang-ads","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kafkasl%2Fgolang-ads","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kafkasl%2Fgolang-ads/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kafkasl%2Fgolang-ads/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kafkasl%2Fgolang-ads/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kafkasl","download_url":"https://codeload.github.com/kafkasl/golang-ads/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246830849,"owners_count":20840894,"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":["advanced-data-structures","frequent-itemsets","golang","path-compression","patricia-trie","skip-list","trie","trie-structure","union-find"],"created_at":"2024-12-15T07:18:45.747Z","updated_at":"2025-04-02T14:26:54.020Z","avatar_url":"https://github.com/kafkasl.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Golang Advanced Data Structures\n\n\n### Tests\n\nRun all the tests, examples and performance evaluations with:\n\n`./bin/run_tests_and_examples.sh`\n\n### Documentation\n\nDetailed documentation and explanation of each data structure and the performance tests is available in:\n\n`./doc/golang_ads.pdf`\n\n### Available Structures\n\n#### Trie\n\n* Location: `./structures/trie`\n* Description:  Implements Trie Structure using as key any Go Rune (and no alphabet size required)\n* Examples: Trie examples are the public examples of problem http://codeforces.com/contest/456/problem/D\n* You can find the actual submission code in `./submissions/submission456D.go`\n\n\n#### Patricia trie\n\n* Location: `./structures/patricia-trie`\n* Description:  Implements Patricia trie Structure as described in Handbook of  Data Structures and Applications book.\n\n\n#### Union-find Set with Path Compression / with Rank\n\n* Location: `./structures/union-find/`\n* Description:  Implements union-find sets. Two variants are available: one using path compression using vectors (most used and efficient); another one using rank for set-union and with pointers.\n* Examples: Union-find examples are the public examples of problem https://jutge.org/problems/P94041_ca/statement and the implementation of Kruskal's minimum spanning tree algorithm\n* You can find the submission code in `./submissions/submissionConnectedComponents.go`\n\n\n#### Skip list\n\n* Location: `./structures/trie`\n* Description:  Implements a map using the skip list structure (instead of a search tree)\n* Examples: `./evaluation/skip-list_performance.go` does a complexity evaluation (both time and space) of the implemented structure. Base package example just tests String() method.  \n\n\n#### Frequent Itemsets\n\n* Location  `./structures/frequent-itemsets`\n* Description:  uses item lists, trie, and patricia tries to represent a frequent itemset\n* Examples: `./evaluation/fis_size-tests.go` creates represents each dataset under `./data` and compares the total memory size of each one of them.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkafkasl%2Fgolang-ads","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkafkasl%2Fgolang-ads","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkafkasl%2Fgolang-ads/lists"}