{"id":20411852,"url":"https://github.com/markopapic/ads","last_synced_at":"2025-03-05T03:19:08.914Z","repository":{"id":143393599,"uuid":"157091463","full_name":"MarkoPapic/ADS","owner":"MarkoPapic","description":"C# implementations of some algorithms and data structures.","archived":false,"fork":false,"pushed_at":"2019-09-19T11:26:19.000Z","size":108,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-16T10:54:40.728Z","etag":null,"topics":["algorithms","csharp","data-structures"],"latest_commit_sha":null,"homepage":"","language":"C#","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/MarkoPapic.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","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-11-11T15:10:17.000Z","updated_at":"2019-09-19T11:26:21.000Z","dependencies_parsed_at":null,"dependency_job_id":"e846fd93-605d-4641-bd0d-aea414b7b856","html_url":"https://github.com/MarkoPapic/ADS","commit_stats":null,"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MarkoPapic%2FADS","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MarkoPapic%2FADS/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MarkoPapic%2FADS/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MarkoPapic%2FADS/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MarkoPapic","download_url":"https://codeload.github.com/MarkoPapic/ADS/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241955577,"owners_count":20048500,"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","csharp","data-structures"],"created_at":"2024-11-15T05:54:12.691Z","updated_at":"2025-03-05T03:19:08.909Z","avatar_url":"https://github.com/MarkoPapic.png","language":"C#","readme":"# Algorithms \u0026 Data Structures\n\n![Nuget](https://img.shields.io/nuget/v/ADS.svg)\n\nC# implementations of some algorithms and data structures.\n\n\n## Installation\n\nVisual Studio Package Manager Console:\n\n```\nInstall-Package ADS -Version 0.0.3\n```\n\ndotnet CLI:\n\n```\ndotnet add package ADS --version 0.0.3\n```\n\n## Content\n\n### Data structures\n\n* Dynamic array\n* Stack\n* Min heap\n* Priority queue\n* Weighted min heap\n* Weighted priority queue\n* Binary search tree\n* Red-black binary search tree.\n* Hash table\n* Graph\n* Digraph\n* Edge-weighted graph\n* Edge-weighted digraph\n* R-way trie\n\n### Algorithms\n\n* Sorting algorithms\n  * Mergesort\n  * Quicksort\n* Graph algorithms\n  * Traverse using DFS\n  * Traverse using BFS\n  * Check if there is a path between the two vertices\n  * Find a path between the two vertices\n  * Sort vertices in topological order\n  * Find the shortest path between the two vertices in an unweighted graph using BFS\n  * Find the shortest path between the two vertices in a graph with nonnegative weights using Dijkstra's algorithm\n  * Find the shortest path between the two vertices in a direct acyclic graph using topological sort\n* Find the maximum sub-array of a 1D array using Kadane's algorithm\n* Dynamic connectivity algorithms\n  * Quick-find\n  * Quick-union\n  * Weighted quick-union\n* String algorithms\n  * Knuth–Morris–Pratt substring search\n  * Boyer-Moore substring search\n  * LSD string sort\n  * MSD string sort\n  * 2-way string quicksort\n* Data compression algorithms\n  * Run-length encoding\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmarkopapic%2Fads","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmarkopapic%2Fads","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmarkopapic%2Fads/lists"}