{"id":24201540,"url":"https://github.com/mstgnz/data-structures","last_synced_at":"2025-09-22T00:31:41.900Z","repository":{"id":133800106,"uuid":"415564615","full_name":"mstgnz/data-structures","owner":"mstgnz","description":"Data Structures With Go","archived":false,"fork":false,"pushed_at":"2025-01-01T18:15:43.000Z","size":1613,"stargazers_count":7,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-01T18:20:59.118Z","etag":null,"topics":["data","data-structures","go","golang"],"latest_commit_sha":null,"homepage":"https://github.com/mstgnz/data-structures","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/mstgnz.png","metadata":{"files":{"readme":"README.md","changelog":"CHANGELOG.md","contributing":"CONTRIBUTING.md","funding":".github/FUNDING.yml","license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","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},"funding":{"github":"mstgnz"}},"created_at":"2021-10-10T11:22:13.000Z","updated_at":"2025-01-01T18:15:46.000Z","dependencies_parsed_at":null,"dependency_job_id":"4f4f9710-5435-4ecf-a22d-645642778211","html_url":"https://github.com/mstgnz/data-structures","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/mstgnz%2Fdata-structures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mstgnz%2Fdata-structures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mstgnz%2Fdata-structures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mstgnz%2Fdata-structures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mstgnz","download_url":"https://codeload.github.com/mstgnz/data-structures/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":233808733,"owners_count":18733601,"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":["data","data-structures","go","golang"],"created_at":"2025-01-13T21:16:19.133Z","updated_at":"2025-09-22T00:31:36.530Z","avatar_url":"https://github.com/mstgnz.png","language":"Go","funding_links":["https://github.com/sponsors/mstgnz"],"categories":[],"sub_categories":[],"readme":"# Data Structures and Algorithms in Go\n\nThis repository contains implementations of various data structures and algorithms in Go programming language. It serves as both a learning resource and a practical reference for developers.\n\n## 📚 Data Structures\n\n### Basic Data Structures\n- **Linked List** - [Documentation](linkedlist/README.md)\n  - Singly Linked List\n  - Doubly Linked List\n  - Circular Linked List\n  - Iterator Pattern Implementation\n  - Thread-safe Operations\n  - Generic Type Support\n- **Stack** - [Documentation](stack/README.md)\n  - Array-based Implementation\n  - Linked List-based Implementation\n  - Thread-safe Operations\n  - Generic Type Support\n- **Queue** - [Documentation](queue/README.md)\n  - Array Queue Implementation\n  - Linked List Queue Implementation\n  - Priority Queue\n  - Circular Queue\n  - Thread-safe Operations\n  - Generic Type Support\n- **Tree** - [Documentation](tree/README.md)\n  - Binary Tree\n  - Binary Search Tree (BST)\n  - AVL Tree (Self-balancing)\n  - Red-Black Tree\n  - B-Tree\n  - Trie (Prefix Tree)\n  - N-ary Tree\n  - Expression Tree\n  - Thread-safe Operations\n- **Heap** - [Documentation](heap/README.md)\n  - Binary Heap\n  - Min Heap\n  - Max Heap\n  - Fibonacci Heap\n  - Binomial Heap\n  - Priority Queue Implementation\n  - Thread-safe Operations\n- **Hash** - [Documentation](hash/README.md)\n  - Hash Table\n  - Hash Map\n  - Hash Set\n  - Consistent Hashing\n  - Linear Probing\n  - Quadratic Probing\n  - Double Hashing\n  - Separate Chaining\n  - Thread-safe Operations\n- **OrderedMap** - [Documentation](orderedmap/README.md)\n  - Thread-safe Implementation\n  - Order Preservation\n  - Concurrent Operations Support\n  - Skip List Implementation\n  - Advanced Features (Copy, Clear, Range iteration)\n  - Generic Type Support\n\n### Advanced Data Structures\n- **Graph** - [Documentation](graph/README.md)\n  - Adjacency Matrix\n  - Adjacency List\n  - Weighted Graph\n  - Directed Graph\n  - Undirected Graph\n  - Graph Algorithms\n    - Depth First Search (DFS)\n    - Breadth First Search (BFS)\n    - Dijkstra's Algorithm\n    - Bellman-Ford Algorithm\n    - Floyd-Warshall Algorithm\n    - Kruskal's Algorithm\n    - Prim's Algorithm\n    - Topological Sort\n    - Strongly Connected Components\n    - Cycle Detection\n\n## 🔧 Algorithms - [Documentation](algorithms/README.md)\n\n### Sorting Algorithms\n- Bubble Sort\n- Selection Sort\n- Insertion Sort\n- Quick Sort\n- Merge Sort\n- Heap Sort\n\n### Searching Algorithms\n- Linear Search\n- Binary Search (Iterative and Recursive)\n- Jump Search\n- Interpolation Search\n- Exponential Search\n- Fibonacci Search\n\n## 🚀 Getting Started\n\n### Prerequisites\n- Go 1.23 or higher\n\n### Installation\n```bash\ngit clone https://github.com/mstgnz/data-structures.git\ncd data-structures\ngo mod download\n```\n\n### Running Tests\n```bash\ngo test ./...\n```\n\n## 🤝 Contributing\n\nContributions are welcome! Please read our [Contributing Guidelines](CONTRIBUTING.md) for details on how to submit pull requests.\n\n## 📝 License\n\nThis project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.\n\n## 🔍 Project Structure\n```\n.\n├── algorithms/    # Basic algorithm implementations\n├── advanced/      # Advanced data structures\n├── examples/      # Usage examples\n├── graph/         # Graph implementations\n├── hash/         # Hash table implementations\n├── heap/         # Heap implementations\n├── linkedlist/   # Linked list implementations\n├── orderedmap/   # Ordered map implementations\n├── queue/        # Queue implementations\n├── stack/        # Stack implementations\n├── tree/         # Tree implementations\n└── utils/        # Utility functions\n```\n\n## ✨ Features\n\n- Clean and efficient implementations\n- Comprehensive test coverage\n- Well-documented code\n- Generic implementations where applicable\n- Performance optimized\n- Thread-safe implementations where necessary\n- Order preservation in map operations\n- Concurrent access support with proper synchronization\n- Advanced data structure features (Copy, Clear, Range operations)\n\n## 📊 Performance\n\nEach implementation includes performance considerations and Big O notation analysis in its respective documentation.\n\n## 🔄 Version History\n\nSee [CHANGELOG.md](CHANGELOG.md) for release history and version details.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmstgnz%2Fdata-structures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmstgnz%2Fdata-structures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmstgnz%2Fdata-structures/lists"}