{"id":13411476,"url":"https://github.com/shady831213/algorithms","last_synced_at":"2025-03-14T17:30:53.268Z","repository":{"id":41086398,"uuid":"119665158","full_name":"shady831213/algorithms","owner":"shady831213","description":"CLRS study. Codes are written with golang.","archived":false,"fork":false,"pushed_at":"2021-03-17T08:01:38.000Z","size":1139,"stargazers_count":792,"open_issues_count":0,"forks_count":120,"subscribers_count":24,"default_branch":"master","last_synced_at":"2024-07-31T20:45:56.802Z","etag":null,"topics":["algorithm","algorithms","bfs-algorithm","binaryheap","clrs","clrs-study","connected-components","dfs-algorithm","disjoint-set","dynamic-programming","go","golang","graph","greedy-algorithms","hashmap","heap","sort","tree"],"latest_commit_sha":null,"homepage":null,"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/shady831213.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}},"created_at":"2018-01-31T09:27:56.000Z","updated_at":"2024-07-27T04:10:51.000Z","dependencies_parsed_at":"2022-07-16T23:46:17.342Z","dependency_job_id":null,"html_url":"https://github.com/shady831213/algorithms","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/shady831213%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shady831213%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shady831213%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shady831213%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/shady831213","download_url":"https://codeload.github.com/shady831213/algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243618633,"owners_count":20320269,"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":["algorithm","algorithms","bfs-algorithm","binaryheap","clrs","clrs-study","connected-components","dfs-algorithm","disjoint-set","dynamic-programming","go","golang","graph","greedy-algorithms","hashmap","heap","sort","tree"],"created_at":"2024-07-30T20:01:13.949Z","updated_at":"2025-03-14T17:30:52.901Z","avatar_url":"https://github.com/shady831213.png","language":"Go","readme":"# algorithms\n[![Go Report Card](https://goreportcard.com/badge/github.com/shady831213/algorithms)](https://goreportcard.com/report/github.com/shady831213/algorithms)[![Build Status](https://travis-ci.org/shady831213/algorithms.svg?branch=master)](https://travis-ci.org/shady831213/algorithms)[![Maintainability](https://api.codeclimate.com/v1/badges/87b7c7f1222dfb1db63e/maintainability)](https://codeclimate.com/github/shady831213/algorithms/maintainability)[![Test Coverage](https://api.codeclimate.com/v1/badges/87b7c7f1222dfb1db63e/test_coverage)](https://codeclimate.com/github/shady831213/algorithms/test_coverage)\n\u003ca href=\"https://996.icu\"\u003e\u003cimg src=\"https://img.shields.io/badge/link-996.icu-red.svg\"\u003e\u003c/a\u003e\n\nCLRS study. Codes are written with golang.\n\n----------------\n\ngo version: 1.11\n\n----------------\n\n  \n- [Heap](https://github.com/shady831213/algorithms/tree/master/heap)\n  - [BinaryHeap on array](https://github.com/shady831213/algorithms/blob/master/heap/arrayHeap.go)\n  - [BinaryHeap on linkedlist](https://github.com/shady831213/algorithms/blob/master/heap/linkedHeap.go)\n  - [LeftistHeap](https://github.com/shady831213/algorithms/blob/master/heap/leftistHeap.go)\n  - [FibonacciHeap](https://github.com/shady831213/algorithms/blob/master/heap/fibHeap.go)\n  \n- [Tree](https://github.com/shady831213/algorithms/tree/master/tree)\n  - [binaryTree](https://github.com/shady831213/algorithms/tree/master/tree/binaryTree)\n    - [BST](https://github.com/shady831213/algorithms/blob/master/tree/binaryTree/binarySearchTree.go)\n    - [RedBlackTree](https://github.com/shady831213/algorithms/blob/master/tree/binaryTree/rbTree.go)\n  - [B-Tree](https://github.com/shady831213/algorithms/tree/master/tree/bTree)\n  - [RS-vEB-Tree](https://github.com/shady831213/algorithms/tree/master/tree/vEBTree)(Support single key multi value.Lazy hashtable is used to instead of array to reduce space complexity.Including Go Mixin design pattern)\n  - [Disjoint-Set-Tree](https://github.com/shady831213/algorithms/tree/master/tree/disjointSetTree)\n  \n- [Graph](https://github.com/shady831213/algorithms/tree/master/graph) (including linkedMap, iterator)\n  - [graph](https://github.com/shady831213/algorithms/blob/master/graph/graph.go)\n  - [BFS](https://github.com/shady831213/algorithms/blob/master/graph/bfs.go)\n  - [DFS](https://github.com/shady831213/algorithms/blob/master/graph/dfs.go)(use stack)\n  - [StronglyConnectedComponents](https://github.com/shady831213/algorithms/blob/master/graph/stronglyConnectedComp.go)\n  - [BioConnectedComponents](https://github.com/shady831213/algorithms/blob/master/graph/bioConnectedComp.go)(vertex bcc \u0026 edge bcc, use stack)  \n  - [eulerCircuit](https://github.com/shady831213/algorithms/blob/master/graph/eulerCircuit.go)  \n  - [mst](https://github.com/shady831213/algorithms/blob/master/graph/mst.go)(including Kruskal([disjointSet](https://github.com/shady831213/algorithms/tree/master/tree/disjointSetTree)) , Prim([fibonacci heap](https://github.com/shady831213/algorithms/blob/master/heap/fibHeap.go)), secondaryMst, mst reduce for Prim, linear time bottleneck spanning tree)\n  - [Single-Source Shortest Path](https://github.com/shady831213/algorithms/blob/master/graph/sssp.go) (including bellmanFord, SPFA, Dijkstra, Gabow )\n  - [All-Pairs Shortest Path](https://github.com/shady831213/algorithms/blob/master/graph/apsp.go) (including FloydWarshall, Johnson)\n  - [Max Flow](https://github.com/shady831213/algorithms/blob/master/graph/flowGraph.go) (including flowGraph , preFlowGraph and allowedGraph data structure, Edmondes Karp, Push Relabel, Relabel to Front, Bipartite Graph Max Match and Hopcraft-Karp)\n  \n- [HashMap](https://github.com/shady831213/algorithms/tree/master/hashMap)(Support UpScale and DownScale)\n  - [OpenAddressHashMap](https://github.com/shady831213/algorithms/blob/master/hashMap/openHashMap.go)\n  - [LinkedListHashMap](https://github.com/shady831213/algorithms/blob/master/hashMap/chainedHashMap.go)\n  \n- [DynamicProgramming](https://github.com/shady831213/algorithms/tree/master/dp) (Including OOP pattern of golang)\n  - [Double adjustable Euclidean traveling salesman](https://github.com/shady831213/algorithms/blob/master/dp/bitonicTSP.go)\n  - [Pretty Print](https://github.com/shady831213/algorithms/blob/master/dp/prettyPrint.go)\n  - [Levenshtein Distance](https://github.com/shady831213/algorithms/blob/master/dp/levenshteinDistance.go)\n  - [Chess Game](https://github.com/shady831213/algorithms/blob/master/dp/chessGame.go)\n  \n- [GreedyAlgorithm](https://github.com/shady831213/algorithms/tree/master/greedy)\n  - [Minimum average end time scheduling](https://github.com/shady831213/algorithms/blob/master/greedy/minAvgCompletedTimeSch.go)\n  \n\n- [Sort](https://github.com/shady831213/algorithms/tree/master/sort)\n  - [CountingSort](https://github.com/shady831213/algorithms/blob/master/sort/countingSort.go)\n  - [HeapSort](https://github.com/shady831213/algorithms/blob/master/sort/heapSort.go)\n  - [InsertSort](https://github.com/shady831213/algorithms/blob/master/sort/insertionSort.go)\n  - [MergeSort](https://github.com/shady831213/algorithms/blob/master/sort/mergeSort.go)\n  - [QuickSort](https://github.com/shady831213/algorithms/blob/master/sort/quickSort.go)\n","funding_links":[],"categories":["Data Structures and Algorithms","Data Structures","数据结构与算法","Generators","Uncategorized","数据结构","Data Integration Frameworks","数据结构`go语言实现的数据结构与算法`"],"sub_categories":["Data Structure and Algorithm Collections","Advanced Console UIs","Standard CLI","数据结构和算法集合","标准 CLI"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshady831213%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshady831213%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshady831213%2Falgorithms/lists"}