{"id":19200191,"url":"https://github.com/jtd-117/ads_py","last_synced_at":"2025-07-25T13:40:08.464Z","repository":{"id":120317997,"uuid":"569672599","full_name":"jtd-117/ads_py","owner":"jtd-117","description":"A collection of 'Algorithms \u0026 Data Structures' (ADS) implemented in the 'Python' programming language.","archived":false,"fork":false,"pushed_at":"2022-12-26T10:48:29.000Z","size":933,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-01-04T12:38:37.184Z","etag":null,"topics":["algorithms","data-structures"],"latest_commit_sha":null,"homepage":"","language":"Python","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/jtd-117.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":"2022-11-23T11:07:31.000Z","updated_at":"2024-09-15T12:42:13.000Z","dependencies_parsed_at":null,"dependency_job_id":"9f4a8323-237c-405c-8bb0-b71f111a2e65","html_url":"https://github.com/jtd-117/ads_py","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/jtd-117%2Fads_py","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jtd-117%2Fads_py/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jtd-117%2Fads_py/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jtd-117%2Fads_py/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jtd-117","download_url":"https://codeload.github.com/jtd-117/ads_py/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240272752,"owners_count":19775095,"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","data-structures"],"created_at":"2024-11-09T12:31:07.749Z","updated_at":"2025-02-23T05:22:43.859Z","avatar_url":"https://github.com/jtd-117.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ALGORITHMS \u0026 DATA STRUCTURES (PYTHON)\n\nA collection of 'Algorithms \u0026 Data Structures' (ADS) implemented in the 'Python' programming language.\n\n## Algorithms:\n\u003ctable\u003e\n    \u003cthead\u003e\n        \u003ctr\u003e\n            \u003cth\u003eTYPE:\u003c/th\u003e\n            \u003cth\u003eCONTENTS:\u003c/th\u003e\n        \u003c/tr\u003e\n    \u003c/thead\u003e\n    \u003ctbody\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"8\"\u003eBasic Sorting\u003c/th\u003e\n            \u003ctd\u003e- Bubble Sort\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Selection Sort\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Insertion Sort\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Quicksort\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Mergesort\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Distribution Counting/Sort\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Radix Sort\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Bucket Sort\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"3\"\u003eBasic Graph Algorithms\u003c/th\u003e\n            \u003ctd\u003e- Depth-First Search (DFS)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Breadth First Search (BFS)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Topological Sort\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"2\"\u003eGraphs: Single Source Shortest Paths\u003c/th\u003e\n            \u003ctd\u003e- Disjkstra Algorithm\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Bellman-Ford Algorithm\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"2\"\u003eGraphs: All Pairs Shortest Paths\u003c/th\u003e\n            \u003ctd\u003e- Floyd-Warshall Algorithm\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Johnson's Algorithm\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"2\"\u003eGraphs: Minimum Spanning Trees\u003c/th\u003e\n            \u003ctd\u003e- Prim's Algorithm\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Kruskal's Algorithm\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"4\"\u003eString Matching\u003c/th\u003e\n            \u003ctd\u003e- Naive String Matching\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Robin-Karp Algorithm\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- KMP Algorithm\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- BMH Algorithm\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"7\"\u003eDynamic Programming\u003c/th\u003e\n            \u003ctd\u003e- Paritition Problem\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Knapsack Problem\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Rod Cutting\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Matrix Chain Multiplication\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Longest Common Subsequence\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Optimal Binary Search Trees\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Parsing Context-Free Grammars\u003c/td\u003e\n        \u003c/tr\u003e\n    \u003c/tbody\u003e\n\u003c/table\u003e\n\n## Data Structures:\n\u003ctable\u003e\n    \u003cthead\u003e\n        \u003ctr\u003e\n            \u003cth\u003eTYPE:\u003c/th\u003e\n            \u003cth\u003eCONTENTS:\u003c/th\u003e\n        \u003c/tr\u003e\n    \u003c/thead\u003e\n    \u003ctbody\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"4\"\u003eLinked Lists\u003c/th\u003e\n            \u003ctd\u003e- Singly Linked Lists (SLL)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Doubly Linked Lists (DLL)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Singly Circular Linked Lists (SCLL)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Doubly Circular Linked Lists (DCLL)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"6\"\u003eStacks \u0026 Queues\u003c/th\u003e\n            \u003ctd\u003e- Array-based Stack\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Array-based Queue\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- SLL Stack (SLLS)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- SLL Queue (SLLQ)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- DLL Queue (DLLQ)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- DLL Stack (DLLS)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"3\"\u003ePriority Queues\u003c/th\u003e\n            \u003ctd\u003e- Binary Heap\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- SLL Priority Queue (SLLPQ)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- DLL Priority Queue (DLLPQ)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"6\"\u003eTrees\u003c/th\u003e\n            \u003ctd\u003e- AVL Trees\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- B-Trees\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Binary Search Trees (BST)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Red-Black Trees (RBT)\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Trie\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Van Emde Boas Trees\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"4\"\u003eHash Maps\u003c/th\u003e\n            \u003ctd\u003e- SLL Chain\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- BST Chain\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- AVL Chain\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Linear Probing\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003cth rowspan=\"3\"\u003eGraphs\u003c/th\u003e\n            \u003ctd\u003e- Adjacency Lists\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Adjacency Matrix\u003c/td\u003e\n        \u003c/tr\u003e\n        \u003ctr\u003e\n            \u003ctd\u003e- Disjoint Sets \u0026 Union Find\u003c/td\u003e\n        \u003c/tr\u003e\n    \u003c/tbody\u003e\n\u003c/table\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjtd-117%2Fads_py","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjtd-117%2Fads_py","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjtd-117%2Fads_py/lists"}