algorithms
CLRS study. Codes are written with golang.
go version: 1.11

 binaryTree
 BTree
 RSvEBTree(Support single key multi value.Lazy hashtable is used to instead of array to reduce space complexity.Including Go Mixin design pattern)
 DisjointSetTree

Graph (including linkedMap, iterator)
 graph
 BFS
 DFS(use stack)
 StronglyConnectedComponents
 BioConnectedComponents(vertex bcc & edge bcc, use stack)
 eulerCircuit
 mst(including Kruskal(disjointSet) , Prim(fibonacci heap), secondaryMst, mst reduce for Prim, linear time bottleneck spanning tree)
 SingleSource Shortest Path (including bellmanFord, SPFA, Dijkstra, Gabow )
 AllPairs Shortest Path (including FloydWarshall, Johnson)
 Max Flow (including flowGraph , preFlowGraph and allowedGraph data structure, Edmondes Karp, Push Relabel, Relabel to Front, Bipartite Graph Max Match and HopcraftKarp)

HashMap(Support UpScale and DownScale)

DynamicProgramming (Including OOP pattern of golang)