{"id":24488685,"url":"https://github.com/raadiah/dsa-using-go","last_synced_at":"2025-03-15T00:30:25.076Z","repository":{"id":272709595,"uuid":"917500850","full_name":"Raadiah/DSA-Using-Go","owner":"Raadiah","description":"Implementing the most used data structures and algorithms using Go. ","archived":false,"fork":false,"pushed_at":"2025-01-16T06:35:04.000Z","size":5,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-16T06:45:55.668Z","etag":null,"topics":["algorithms","algorithms-and-data-structures","data-structures","golang"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Raadiah.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2025-01-16T05:27:10.000Z","updated_at":"2025-01-16T06:01:45.000Z","dependencies_parsed_at":"2025-01-16T06:51:31.260Z","dependency_job_id":"a53b9c5b-ba5c-4464-99c7-5c4110c60c63","html_url":"https://github.com/Raadiah/DSA-Using-Go","commit_stats":null,"previous_names":["raadiah/dsa-using-go"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Raadiah%2FDSA-Using-Go","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Raadiah%2FDSA-Using-Go/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Raadiah%2FDSA-Using-Go/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Raadiah%2FDSA-Using-Go/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Raadiah","download_url":"https://codeload.github.com/Raadiah/DSA-Using-Go/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243667541,"owners_count":20328032,"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":["algorithms","algorithms-and-data-structures","data-structures","golang"],"created_at":"2025-01-21T16:29:19.532Z","updated_at":"2025-03-15T00:30:25.042Z","avatar_url":"https://github.com/Raadiah.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Implementation of Different Data Structures and Algorithms using Go\n\nIn this project, we will implement different Data Structures and Algorithms using Go. We will be using the ***Fundamentals of Computer Algorithms***  by *E. Horowitz et.al* as a reference book.\n\nThis will be a command line tool programming. Also, you can import packages to your project.\n\n#### Import Package\n\nTo add the module into your package enter into your project directory terminal the following code:\n\n```go get github.com/Raadiah/DSA-Using-Go@v0.5.0```\n\nThen using the following imports you can import the respective packages\n\n### Data Structures\n\n#### [Stack](/stack/stack.md)\n```import \"github.com/Raadiah/DSA-Using-Go@v0.5.0/stack\"```\n\nThen any stack operations can be done.\n\n- stack.GetArrayStack() - To create an array stack\n- stack.GetLinkedListStack() - To create a linked list stack\n\nFrom a stacker object created from the above methods, the following methods can be called:\n\n- Top() - To get top element. Nil is returned if no top is set\n- Delete() - Delete the top element. Returns true for deleted, false for empty stack\n- Insert(item) - Insert element to the top\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraadiah%2Fdsa-using-go","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fraadiah%2Fdsa-using-go","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraadiah%2Fdsa-using-go/lists"}