Algorithm (Sedgewick, 4th) implemented in golang.
Document

Basic

• Stack
• Queue
  • Array List
  • Linked List
• Set
• Union-Find

Sorting

• Bubblesort
• Heapsort
• Insertsort
• Mergesort
• Quicksort
• Selectsort
• Shellsort

Searching

• Binary Search Tree
• AVL Tree
• Red-Black Tree
• Hash Table

Graphs

• Directed Graph
  • BFS
  • DFS
  • Reachability
  • Strongly Connected Components (kosaraju)
  • Bipartite Graph
  • Topological Sorting
  • Ring Detection
• Undirected Graph
  • Subgraph
  • Ring Detection
• Minimum Spanning Tree
  • Lazy-Prim
  • Prim
  • Kruskal
• Shortest Path
  • Dijkstra
  • Topological
  • BellmanFord

Strings

• String Sort
  • Most-significant-digit-first
  • Three-way String Quicksort
• Trie
  • R-way Trie
  • Ternary Search Trie (TST)
• Substring Search
  • Knuth-Morris-Pratt
  • Boyer-Moore
  • Rabin-Karp
• Regular Expression
• Data Compression
  • Huffman
  • LZW

Priority Queues

• Heap
• Leftist Heap
• Binomial Heap