C#中通用实现的100多个算法和数据结构

以下是 Advanced Algorithms 文档中提到的算法：

数据结构

• 列表 (List)
• 跳跃表 (Skip list)
• 哈希集 (HashSets)
• 字典 (Dictionaries)
• 栈 (Stack)
• 队列 (Queue)
• 优先队列 (Priority queue)
• 链表 (Singly linked list, Doubly linked list, Circular linked list)
• 堆 (Binary heap, d-ary heap, Binomial heap, Fibonacci heap, Pairing heap)
• 树 (Tree)
• 二叉树 (Binary tree)
• 二叉搜索树 (Binary search tree, AVL tree, Red black tree, Splay tree, Treap tree)
• B 树 (B-tree, B tree)
• 可查询树 (Segment tree, Binary indexed tree, Multi-dimensional interval tree, Multi-dimensional k-d tree, Multi-dimensional range tree, R-tree, Quadtree)
• 查找树 (Prefix tree, Suffix tree, Ternary search tree)
• 集合 (Set, Disjoint set, Sparse set, Bloom filter)
• 图 (Graph, Adjacency list/matrix, Weighted Graph, DiGraph, Weighted DiGraph)

算法

• 图算法
  • 关节点 (Tarjan's)
  • 桥梁 (Tarjan's)
  • 连通性 (Kosaraju's, Tarjan's strongly connected component, Tarjan's bi-connected graph tester)
  • 着色 (M-coloring)
  • 覆盖 (Min vertex cover)
  • 最大流 (Ford-Fulkerson, Edmonds Karp, Push relabel)
  • 最短路径 (Bellman-Ford, Dijkstra's, Floyd-Warshall, Johnson's, Travelling salesman path, A* search)
  • 匹配 (Max bipartite matching using Edmonds Karp, Max bipartite matching using Hopcroft Karp)
  • 割集 (Minimum cut using Edmonds Karp)
  • 环路检测
  • 搜索 (Depth first, Breadth first, Bi-directional)
  • 拓扑排序 (Depth first method, Kahn's algorithm)
  • 最小生成树 (Kruskal's, Prim's)
• 字符串
  • Manacher's algorithm for longest palindrome
  • 模式匹配 (Rabin-Karp, Knuth–Morris–Pratt, Z algorithm)
• 压缩
  • 霍夫曼编码 (Huffman coding)
• 排序和搜索
  • 二分查找 (Binary search)
  • 快速选择 (Quick select)
  • 多数元素 (Boyer-Moore voting)
  • 排序算法 (Bubble sort, Insertion sort, Selection sort, Shell sort, Tree sort, Quick sort, Heap sort, Merge sort, Bucket sort, Radix sort, Counting sort)
• 组合数学
  • 排列 (Permutations)
  • 组合 (Combinations)
  • 子集 (Subsets)
• 分布式系统
  • 循环队列 (Ring buffer)
  • 一致性哈希 (Consistent hash)
  • LRU 缓存 (LRU cache)
  • 异步生产者-消费者队列 (Asynchronous producer-consumer queue)
• 数值方法
  • 素数检验 (Check primality)
  • 生成素数 (Sieve of Eratosthenes)
  • 快速幂 (Fast exponentiation)
• 二维几何 *凸包 (Convex hull, Gift wrapping algorithm)
  • 线段相交 (Line intersection)
  • 最近点对 (Closest point pair)
  • 判断点是否在多边形内 (Point in polygon)
  • 矩形相交 (Rectangle intersection)
  • 点旋转 (Point rotation)
  • 线段相交 (Bentley-Ottmann sweep line algorithm)
• 位操作
  • 基数转换 (Base conversion)
  • 对数 (Logarithm, base 2 & 10)
  • 最大公约数 (GCD)

【实例截图】

文件清单

• └── advanced-algorithms-a7bfe1555f1a623525415ab91725a3ff26b7cf69
      ├── _config.yml
      ├── docs
      │   ├── api
      │   │   ├── Advanced.Algorithms.Binary.BaseConversion.html
      │   │   ├── Advanced.Algorithms.Binary.BitHacks.html
      │   │   ├── Advanced.Algorithms.Binary.DivisionModulus.html
      │   │   ├── Advanced.Algorithms.Binary.Gcd.html
      │   │   ├── Advanced.Algorithms.Binary.html
      │   │   ├── Advanced.Algorithms.Binary.IntToBinary.html
      │   │   ├── Advanced.Algorithms.Binary.IsMultipleOfNine.html
      │   │   ├── Advanced.Algorithms.Binary.IsMultipleOfThree.html
      │   │   ├── Advanced.Algorithms.Binary.Logarithm.html
      │   │   ├── Advanced.Algorithms.Binary.NextPowOfTwo.html
      │   │   ├── Advanced.Algorithms.Binary.ToggleCase.html
      │   │   ├── Advanced.Algorithms.Combinatorics.Combination.html
      │   │   ├── Advanced.Algorithms.Combinatorics.html
      │   │   ├── Advanced.Algorithms.Combinatorics.Permutation.html
      │   │   ├── Advanced.Algorithms.Combinatorics.Subset.html
      │   │   ├── Advanced.Algorithms.Compression.html
      │   │   ├── Advanced.Algorithms.Compression.HuffmanCoding-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.ArrayList-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.ArrayListEnumerator-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.AVLTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BinaryTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BinaryTreeNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BinomialHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BinomialHeapNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BinomialMaxHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BinomialMinHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BloomFilter-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BMaxHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BMinHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BpTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BpTreeEnumerator-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BST-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BSTBase-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.BSTExtensions.html
      │   │   ├── Advanced.Algorithms.DataStructures.BTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.CircularLinkedList-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.CircularLinkedListEnumerator-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.CircularLinkedListNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.DaryHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.D_aryMaxHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.DaryMaxHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.D_aryMinHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.DaryMinHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Dictionaries.Dictionary-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Dictionaries.DictionaryType.html
      │   │   ├── Advanced.Algorithms.DataStructures.Dictionaries.html
      │   │   ├── Advanced.Algorithms.DataStructures.Dictionaries.SortedDictionary-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Dictionary-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.DictionaryNode-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.DictionaryType.html
      │   │   ├── Advanced.Algorithms.DataStructures.DInterval-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.DIntervalTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.DisJointSet-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.DoublyLinkedList-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.DoublyLinkedListEnumerator-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.DoublyLinkedListNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.DRangeTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.ExpressionTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.FenwickTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.FibonacciHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.FibornacciHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.FibornacciHeapNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.FibornacciMaxHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.FibornacciMinHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.ArrayList-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.Dictionary-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.DictionaryType.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.HashSet-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.HashSetType.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.OrderedDictionary-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.OrderedHashSet-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.Queue-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.QueueType.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.SortedDictionary-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.SortedHashSet-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.Stack-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Foundation.StackType.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraph-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyList.Graph-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyList.GraphVertex-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyList.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraph-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraphVertex-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.DiGraph-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedGraph-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.IDiEdge-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.IDiGraph-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.IDiGraphVertex-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.IEdge-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.IGraph-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Graph.IGraphVertex-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.HashSet-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.HashSetNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.HashSets.HashSet-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.HashSets.HashSetNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.HashSets.HashSetType.html
      │   │   ├── Advanced.Algorithms.DataStructures.HashSets.html
      │   │   ├── Advanced.Algorithms.DataStructures.HashSets.SortedHashSet-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.HashSetType.html
      │   │   ├── Advanced.Algorithms.DataStructures.html
      │   │   ├── Advanced.Algorithms.DataStructures.IBSTNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.IDistanceCalculator-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Interval-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.IntervalTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.KDTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.MaxPriorityQueue-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.MinPriorityQueue-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.OpenAddressDictionaryEnumerator-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.OpenAddressHashSetEnumerator-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.PairingHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.PairingHeapNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.PairingMaxHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.PairingMinHeap-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.PriorityQueue-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.QuadTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Queue-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.QueueType.html
      │   │   ├── Advanced.Algorithms.DataStructures.RangeTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.RedBlackTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.RTree.html
      │   │   ├── Advanced.Algorithms.DataStructures.SegmentTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.SeparateChainingDictionaryEnumerator-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.SeparateChainingHashSetEnumerator-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.SinglyLinkedList-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.SinglyLinkedListNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.SkipList-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.SortedDictionary-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.SortedHashSet-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.SparseSet.html
      │   │   ├── Advanced.Algorithms.DataStructures.SplayTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Stack-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.StackType.html
      │   │   ├── Advanced.Algorithms.DataStructures.SuffixTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.TernarySearchTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.TreapTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Tree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.TreeDictionary-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.TreeDictionaryNode-2.html
      │   │   ├── Advanced.Algorithms.DataStructures.TreeHashSet-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Tree.html
      │   │   ├── Advanced.Algorithms.DataStructures.TreeNode-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Tree.QuadTree-1.html
      │   │   ├── Advanced.Algorithms.DataStructures.Trie-1.html
      │   │   ├── Advanced.Algorithms.Distributed.AsyncQueue-1.html
      │   │   ├── Advanced.Algorithms.Distributed.CircularQueue-1.html
      │   │   ├── Advanced.Algorithms.Distributed.ConsistentHash-1.html
      │   │   ├── Advanced.Algorithms.Distributed.html
      │   │   ├── Advanced.Algorithms.Distributed.LRUCache-2.html
      │   │   ├── Advanced.Algorithms.Geometry.BentleyOttmann.html
      │   │   ├── Advanced.Algorithms.Geometry.ClosestPointPair.html
      │   │   ├── Advanced.Algorithms.Geometry.ConvexHull.html
      │   │   ├── Advanced.Algorithms.Geometry.html
      │   │   ├── Advanced.Algorithms.Geometry.LineExtensions.html
      │   │   ├── Advanced.Algorithms.Geometry.Line.html
      │   │   ├── Advanced.Algorithms.Geometry.LineIntersection.html
      │   │   ├── Advanced.Algorithms.Geometry.PointComparer.html
      │   │   ├── Advanced.Algorithms.Geometry.Point.html
      │   │   ├── Advanced.Algorithms.Geometry.PointInsidePolygon.html
      │   │   ├── Advanced.Algorithms.Geometry.PointRotation.html
      │   │   ├── Advanced.Algorithms.Geometry.Polygon.html
      │   │   ├── Advanced.Algorithms.Geometry.RectangleComparer.html
      │   │   ├── Advanced.Algorithms.Geometry.Rectangle.html
      │   │   ├── Advanced.Algorithms.Geometry.RectangleIntersection.html
      │   │   ├── Advanced.Algorithms.Graph.AllPairShortestPathResult-2.html
      │   │   ├── Advanced.Algorithms.Graph.AStarShortestPath-2.html
      │   │   ├── Advanced.Algorithms.Graph.BellmanFordShortestPath-2.html
      │   │   ├── Advanced.Algorithms.Graph.BiDirectional-1.html
      │   │   ├── Advanced.Algorithms.Graph.BiPartiteMatching-1.html
      │   │   ├── Advanced.Algorithms.Graph.BreadthFirst-1.html
      │   │   ├── Advanced.Algorithms.Graph.Bridge-1.html
      │   │   ├── Advanced.Algorithms.Graph.CycleDetector-1.html
      │   │   ├── Advanced.Algorithms.Graph.DepthFirst-1.html
      │   │   ├── Advanced.Algorithms.Graph.DepthFirstTopSort-1.html
      │   │   ├── Advanced.Algorithms.Graph.DijikstraShortestPath-2.html
      │   │   ├── Advanced.Algorithms.Graph.EdmondKarpMaxFlow-2.html
      │   │   ├── Advanced.Algorithms.Graph.FloydWarshallShortestPath-2.html
      │   │   ├── Advanced.Algorithms.Graph.FordFulkersonMaxFlow-2.html
      │   │   ├── Advanced.Algorithms.Graph.HopcroftKarpMatching-1.html
      │   │   ├── Advanced.Algorithms.Graph.html
      │   │   ├── Advanced.Algorithms.Graph.IAStarHeuristic-2.html
      │   │   ├── Advanced.Algorithms.Graph.IBiPartiteMatchOperators-1.html
      │   │   ├── Advanced.Algorithms.Graph.IFlowOperators-1.html
      │   │   ├── Advanced.Algorithms.Graph.IJohnsonsShortestPathOperators-2.html
      │   │   ├── Advanced.Algorithms.Graph.IShortestPathOperators-1.html
      │   │   ├── Advanced.Algorithms.Graph.JohnsonsShortestPath-2.html
      │   │   ├── Advanced.Algorithms.Graph.KahnsTopSort-1.html
      │   │   ├── Advanced.Algorithms.Graph.KosarajuStronglyConnected-1.html
      │   │   ├── Advanced.Algorithms.Graph.Kruskals-2.html
      │   │   ├── Advanced.Algorithms.Graph.MatchEdge-1.html
      │   │   ├── Advanced.Algorithms.Graph.MColorer-2.html
      │   │   ├── Advanced.Algorithms.Graph.MColorResult-2.html
      │   │   ├── Advanced.Algorithms.Graph.MinCut-2.html
      │   │   ├── Advanced.Algorithms.Graph.MinCutEdge-1.html
      │   │   ├── Advanced.Algorithms.Graph.MinVertexCover-1.html
      │   │   ├── Advanced.Algorithms.Graph.MSTEdge-2.html
      │   │   ├── Advanced.Algorithms.Graph.Prims-2.html
      │   │   ├── Advanced.Algorithms.Graph.PushRelabelMaxFlow-2.html
      │   │   ├── Advanced.Algorithms.Graph.ShortestPathResult-2.html
      │   │   ├── Advanced.Algorithms.Graph.TarjansArticulationFinder-1.html
      │   │   ├── Advanced.Algorithms.Graph.TarjansBiConnected-1.html
      │   │   ├── Advanced.Algorithms.Graph.TarjansBridgeFinder-1.html
      │   │   ├── Advanced.Algorithms.Graph.TarjansStronglyConnected-1.html
      │   │   ├── Advanced.Algorithms.Graph.TravellingSalesman-2.html
      │   │   ├── Advanced.Algorithms.Graph.TravellingSalesman.html
      │   │   ├── Advanced.Algorithms.html
      │   │   ├── Advanced.Algorithms.Miscellaneous.html
      │   │   ├── Advanced.Algorithms.Miscellaneous.MatrixMultiplication.html
      │   │   ├── Advanced.Algorithms.Numerical.FastExponentiation.html
      │   │   ├── Advanced.Algorithms.Numerical.html
      │   │   ├── Advanced.Algorithms.Numerical.KthSmallest-1.html
      │   │   ├── Advanced.Algorithms.Numerical.MedianStream.html
      │   │   ├── Advanced.Algorithms.Numerical.PrimeGenerator.html
      │   │   ├── Advanced.Algorithms.Numerical.PrimeTester.html
      │   │   ├── Advanced.Algorithms.Search.BinarySearch.html
      │   │   ├── Advanced.Algorithms.Search.BoyerMoore-1.html
      │   │   ├── Advanced.Algorithms.Search.html
      │   │   ├── Advanced.Algorithms.Search.QuickSelect-1.html
      │   │   ├── Advanced.Algorithms.Search.SearchAlmostSorted.html
      │   │   ├── Advanced.Algorithms.SortDirection.html
      │   │   ├── Advanced.Algorithms.Sorting.BubbleSort-1.html
      │   │   ├── Advanced.Algorithms.Sorting.BucketSort.html
      │   │   ├── Advanced.Algorithms.Sorting.CountingSort.html
      │   │   ├── Advanced.Algorithms.Sorting.HeapSort-1.html
      │   │   ├── Advanced.Algorithms.Sorting.html
      │   │   ├── Advanced.Algorithms.Sorting.InsertionSort-1.html
      │   │   ├── Advanced.Algorithms.Sorting.MergeSort-1.html
      │   │   ├── Advanced.Algorithms.Sorting.QuickSort-1.html
      │   │   ├── Advanced.Algorithms.Sorting.RadixSort.html
      │   │   ├── Advanced.Algorithms.Sorting.SelectionSort-1.html
      │   │   ├── Advanced.Algorithms.Sorting.ShellSort-1.html
      │   │   ├── Advanced.Algorithms.Sorting.SortAlmostSorted.html
      │   │   ├── Advanced.Algorithms.Sorting.TreeSort-1.html
      │   │   ├── Advanced.Algorithms.String.html
      │   │   ├── Advanced.Algorithms.String.KMP.html
      │   │   ├── Advanced.Algorithms.String.ManachersPalindrome.html
      │   │   ├── Advanced.Algorithms.String.RabinKarp.html
      │   │   ├── Advanced.Algorithms.String.ZAlgorithm.html
      │   │   └── toc.html
      │   ├── favicon.ico
      │   ├── fonts
      │   │   ├── glyphicons-halflings-regular.eot
      │   │   ├── glyphicons-halflings-regular.svg
      │   │   ├── glyphicons-halflings-regular.ttf
      │   │   ├── glyphicons-halflings-regular.woff
      │   │   └── glyphicons-halflings-regular.woff2
      │   ├── index.json
      │   ├── logo.svg
      │   ├── search-stopwords.json
      │   ├── styles
      │   │   ├── docfx.css
      │   │   ├── docfx.js
      │   │   ├── docfx.vendor.css
      │   │   ├── docfx.vendor.js
      │   │   ├── lunr.js
      │   │   ├── lunr.min.js
      │   │   ├── main.css
      │   │   ├── main.js
      │   │   └── search-worker.js
      │   └── xrefmap.yml
      ├── LICENSE
      ├── NuGet.config
      ├── omnisharp.json
      ├── PULL_REQUEST_TEMPLATE.md
      ├── README.md
      ├── src
      │   ├── Advanced.Algorithms
      │   │   ├── Advanced.Algorithms.csproj
      │   │   ├── App.config
      │   │   ├── Binary
      │   │   │   ├── BaseConversion.cs
      │   │   │   ├── GCD.cs
      │   │   │   └── Logarithm.cs
      │   │   ├── Combinatorics
      │   │   │   ├── Combination.cs
      │   │   │   ├── Permutation.cs
      │   │   │   └── Subset.cs
      │   │   ├── Compression
      │   │   │   └── HuffmanCoding.cs
      │   │   ├── DataStructures
      │   │   │   ├── Dictionary
      │   │   │   │   ├── Dictionary.cs
      │   │   │   │   ├── OpenAddressDictionary.cs
      │   │   │   │   ├── OrderedDictionary.cs
      │   │   │   │   └── SeparateChainingDictionary.cs
      │   │   │   ├── Graph
      │   │   │   │   ├── AdjacencyList
      │   │   │   │   │   ├── DiGraph.cs
      │   │   │   │   │   ├── Graph.cs
      │   │   │   │   │   ├── WeightedDiGraph.cs
      │   │   │   │   │   └── WeightedGraph.cs
      │   │   │   │   ├── AdjacencyMatrix
      │   │   │   │   │   ├── DiGraph.cs
      │   │   │   │   │   ├── Graph.cs
      │   │   │   │   │   ├── WeightedDiGraph.cs
      │   │   │   │   │   └── WeightedGraph.cs
      │   │   │   │   ├── IDiGraph.cs
      │   │   │   │   └── IGraph.cs
      │   │   │   ├── HashSet
      │   │   │   │   ├── HashSet.cs
      │   │   │   │   ├── OpenAddressHashSet.cs
      │   │   │   │   ├── OrderedHashSet.cs
      │   │   │   │   └── SeparateChainingHashSet.cs
      │   │   │   ├── Heap
      │   │   │   │   ├── BHeap.cs
      │   │   │   │   ├── BinomialHeap.cs
      │   │   │   │   ├── d-aryHeap.cs
      │   │   │   │   ├── FibonacciHeap.cs
      │   │   │   │   ├── PairingHeap.cs
      │   │   │   │   └── Shared
      │   │   │   │       ├── BinomialHeapNode.cs
      │   │   │   │       ├── FibornacciHeapNode.cs
      │   │   │   │       └── PairingHeapNode.cs
      │   │   │   ├── LinkedList
      │   │   │   │   ├── CircularLinkedList.cs
      │   │   │   │   ├── DoublyLinkedList.cs
      │   │   │   │   └── SinglyLinkedList.cs
      │   │   │   ├── List
      │   │   │   │   ├── ArrayList.cs
      │   │   │   │   └── SkipList.cs
      │   │   │   ├── Queues
      │   │   │   │   ├── ArrayQueue.cs
      │   │   │   │   ├── LinkedListQueue.cs
      │   │   │   │   ├── PriorityQueue.cs
      │   │   │   │   └── Queue.cs
      │   │   │   ├── Set
      │   │   │   │   ├── BloomFilter.cs
      │   │   │   │   ├── DisJointSet.cs
      │   │   │   │   └── SparseSet.cs
      │   │   │   ├── Shared
      │   │   │   │   └── IEnumerableExtensions.cs
      │   │   │   ├── Stack
      │   │   │   │   ├── ArrayStack.cs
      │   │   │   │   ├── LinkedListStack.cs
      │   │   │   │   └── Stack.cs
      │   │   │   └── Tree
      │   │   │       ├── AvlTree.cs
      │   │   │       ├── BinaryTree.cs
      │   │   │       ├── BST.cs
      │   │   │       ├── B Tree.cs
      │   │   │       ├── BTree.cs
      │   │   │       ├── FenwickTree.cs
      │   │   │       ├── IntervalTree.cs
      │   │   │       ├── K_DTree.cs
      │   │   │       ├── QuadTree.cs
      │   │   │       ├── RangeTree.cs
      │   │   │       ├── RedBlackTree.cs
      │   │   │       ├── RTree.cs
      │   │   │       ├── SegmentTree.cs
      │   │   │       ├── Shared
      │   │   │       │   ├── ArrayComparer.cs
      │   │   │       │   ├── BSTEnumerator.cs
      │   │   │       │   ├── BSTExtensions.cs
      │   │   │       │   ├── BSTHelpers.cs
      │   │   │       │   └── BSTNodeBase.cs
      │   │   │       ├── SplayTree.cs
      │   │   │       ├── SuffixTree.cs
      │   │   │       ├── TernarySearchTree.cs
      │   │   │       ├── TreapTree.cs
      │   │   │       ├── Tree.cs
      │   │   │       └── Trie.cs
      │   │   ├── Distributed
      │   │   │   ├── AsyncQueue.cs
      │   │   │   ├── CircularQueue.cs
      │   │   │   ├── ConsistentHash.cs
      │   │   │   └── LRUCache.cs
      │   │   ├── Geometry
      │   │   │   ├── BentleyOttmann.cs
      │   │   │   ├── ClosestPointPair.cs
      │   │   │   ├── ConvexHull.cs
      │   │   │   ├── LineIntersection.cs
      │   │   │   ├── PointInsidePolygon.cs
      │   │   │   ├── PointRotation.cs
      │   │   │   ├── RectangleIntersection.cs
      │   │   │   ├── Shapes
      │   │   │   │   ├── Line.cs
      │   │   │   │   ├── Point.cs
      │   │   │   │   ├── Polygon.cs
      │   │   │   │   └── Rectangle.cs
      │   │   │   └── Shared
      │   │   │       ├── DoubleExtensions.cs
      │   │   │       ├── PointComparer.cs
      │   │   │       └── RectangleComparer.cs
      │   │   ├── Graph
      │   │   │   ├── ArticulationPoint
      │   │   │   │   └── TarjansArticulationFinder.cs
      │   │   │   ├── Bridge
      │   │   │   │   └── TarjansBridgeFinder.cs
      │   │   │   ├── Coloring
      │   │   │   │   └── MColorer.cs
      │   │   │   ├── Connectivity
      │   │   │   │   ├── KosarajuStronglyConnected.cs
      │   │   │   │   ├── TarjansBiConnected.cs
      │   │   │   │   └── TarjansStronglyConnected.cs
      │   │   │   ├── Cover
      │   │   │   │   └── MinVertexCover.cs
      │   │   │   ├── Cut
      │   │   │   │   └── MinimumCut.cs
      │   │   │   ├── Cycle
      │   │   │   │   └── CycleDetection.cs
      │   │   │   ├── Flow
      │   │   │   │   ├── EdmondsKarp.cs
      │   │   │   │   ├── FordFulkerson.cs
      │   │   │   │   └── PushRelabel.cs
      │   │   │   ├── Matching
      │   │   │   │   ├── BiPartiteMatching.cs
      │   │   │   │   └── HopcroftKarp.cs
      │   │   │   ├── MinimumSpanningTree
      │   │   │   │   ├── Kruskals.cs
      │   │   │   │   └── Prims.cs
      │   │   │   ├── Search
      │   │   │   │   ├── BiDirectional.cs
      │   │   │   │   ├── BreadthFirst.cs
      │   │   │   │   └── DepthFirst.cs
      │   │   │   ├── ShortestPath
      │   │   │   │   ├── AStar.cs
      │   │   │   │   ├── Bellman-Ford.cs
      │   │   │   │   ├── Dijikstra.cs
      │   │   │   │   ├── Floyd-Warshall.cs
      │   │   │   │   ├── Johnsons.cs
      │   │   │   │   └── TravellingSalesman.cs
      │   │   │   └── Sort
      │   │   │       ├── DepthFirstTopSort.cs
      │   │   │       └── KahnTopSort.cs
      │   │   ├── Numerical
      │   │   │   ├── Exponentiation.cs
      │   │   │   ├── PrimeGenerator.cs
      │   │   │   └── PrimeTester.cs
      │   │   ├── Properties
      │   │   │   └── AssemblyInfo.cs
      │   │   ├── Search
      │   │   │   ├── BinarySearch.cs
      │   │   │   ├── BoyerMoore.cs
      │   │   │   └── QuickSelect.cs
      │   │   ├── Shared
      │   │   │   ├── CustomComparer.cs
      │   │   │   └── SortDirection.cs
      │   │   ├── Sorting
      │   │   │   ├── BubbleSort.cs
      │   │   │   ├── BucketSort.cs
      │   │   │   ├── CountingSort.cs
      │   │   │   ├── HeapSort.cs
      │   │   │   ├── InsertionSort.cs
      │   │   │   ├── MergeSort.cs
      │   │   │   ├── QuickSort.cs
      │   │   │   ├── RadixSort.cs
      │   │   │   ├── SelectionSort.cs
      │   │   │   ├── ShellSort.cs
      │   │   │   └── TreeSort.cs
      │   │   ├── String
      │   │   │   ├── ManachersPalindrome.cs
      │   │   │   └── Search
      │   │   │       ├── KMP.cs
      │   │   │       ├── RabinKarp.cs
      │   │   │       └── ZAlgorithm.cs
      │   │   └── StrongNameKey.snk
      │   ├── Advanced.Algorithms.Docs.sln
      │   └── Advanced.Algorithms.sln
      └── tests
          ├── Advanced.Algorithms.Tests
          │   ├── Advanced.Algorithms.Tests.csproj
          │   ├── Advanced.Algorithms.Tests.Mono.csproj
          │   ├── Advanced.Algorithms.Tests.NetCore.csproj
          │   ├── Binary
          │   │   ├── BaseConversion_Tests.cs
          │   │   ├── GCD_Tests.cs
          │   │   └── Logarithm_Tests.cs
          │   ├── Combinatorics
          │   │   ├── Combination_Tests.cs
          │   │   ├── Permutation_Tests.cs
          │   │   └── Subset_Tests.cs
          │   ├── Compression
          │   │   └── HuffmanCoding_Tests.cs
          │   ├── DataStructures
          │   │   ├── Dictionary
          │   │   │   ├── Dictionary_Tests.cs
          │   │   │   └── OrderedDictionary_Tests.cs
          │   │   ├── Graph
          │   │   │   ├── AdjacencyList
          │   │   │   │   ├── DiGraph_Tests.cs
          │   │   │   │   ├── Graph_Tests.cs
          │   │   │   │   ├── WeightedDiGraph_Tests.cs
          │   │   │   │   └── WeightedGraph_Tests.cs
          │   │   │   └── AdjacencyMatrix
          │   │   │       ├── DiGraph_Tests.cs
          │   │   │       ├── Graph_Tests.cs
          │   │   │       ├── WeightedDiGraph_Tests.cs
          │   │   │       └── WeightedGraph_Tests.cs
          │   │   ├── HashSet
          │   │   │   ├── HashSet_Tests.cs
          │   │   │   └── OrderedHashSet_Tests.cs
          │   │   ├── Heap
          │   │   │   ├── BHeap_Tests.cs
          │   │   │   ├── BinomialHeap_Tests.cs
          │   │   │   ├── D-aryHeap_Tests.cs
          │   │   │   ├── FibonacciHeap_Tests.cs
          │   │   │   └── PairingHeap_Tests.cs
          │   │   ├── LinkedList
          │   │   │   ├── CircularLinkedList_Tests.cs
          │   │   │   ├── DoublyLinkedList_Tests.cs
          │   │   │   └── SinglyLinkedList_Tests.cs
          │   │   ├── Lists
          │   │   │   ├── ArrayList_Tests.cs
          │   │   │   └── SkipList_Tests.cs
          │   │   ├── Queues
          │   │   │   ├── PriorityQueue_Tests.cs
          │   │   │   └── Queue_Tests.cs
          │   │   ├── Set
          │   │   │   ├── BloomFilter_Tests.cs
          │   │   │   ├── DisJointSet_Tests.cs
          │   │   │   └── SparseSet_Tests.cs
          │   │   ├── Stack_Tests.cs
          │   │   └── Tree
          │   │       ├── AVLTree_Tests.cs
          │   │       ├── BinaryTree_Tests.cs
          │   │       ├── BST_Tests.cs
          │   │       ├── B Tree_Tests.cs
          │   │       ├── BTree_Tests.cs
          │   │       ├── FenwickTree_Tests.cs
          │   │       ├── IntervalTree_Tests.cs
          │   │       ├── KdTree_Tests.cs
          │   │       ├── QuadTree_Tests.cs
          │   │       ├── RangeTreeTests.cs
          │   │       ├── RedBlackTree_Tests.cs
          │   │       ├── RTree_Tests.cs
          │   │       ├── SegmentTree_Tests.cs
          │   │       ├── SplayTree_Tests.cs
          │   │       ├── SuffixTree_Tests.cs
          │   │       ├── TernarySearchTree_Tests.cs
          │   │       ├── TestHelpers
          │   │       │   ├── BSTTester.cs
          │   │       │   └── BTreeTester.cs
          │   │       ├── TreapTree_Tests.cs
          │   │       ├── Tree_Tests.cs
          │   │       └── Trie_Tests.cs
          │   ├── Distributed
          │   │   ├── AsyncQueue_Tests.cs
          │   │   ├── CircularQueue_Tests.cs
          │   │   ├── ConsistentHash_Tests.cs
          │   │   └── LRUCache_Tests.cs
          │   ├── Geometry
          │   │   ├── BentleyOttmann_Tests.cs
          │   │   ├── ClosestPointPair_Tests.cs
          │   │   ├── ConvexHull_Tests.cs
          │   │   ├── LineIntersection_Tests.cs
          │   │   ├── PointInsidePolygon_Tests.cs
          │   │   ├── PointRotation_Tests.cs
          │   │   └── RectangleIntersection_Tests.cs
          │   ├── Graph
          │   │   ├── ArticulationPoints
          │   │   │   └── TarjansArticulation_Tests.cs
          │   │   ├── Bridge
          │   │   │   └── TarjansBridge_Tests.cs
          │   │   ├── Coloring
          │   │   │   └── MColoring_Tests.cs
          │   │   ├── Connectivity
          │   │   │   ├── KosarajuStronglyConnected_Tests.cs
          │   │   │   ├── TarjansBiConnected_Tests.cs
          │   │   │   └── TarjansStronglyConnected_Tests.cs
          │   │   ├── Cover
          │   │   │   └── MinVertexCover.cs
          │   │   ├── Cut
          │   │   │   └── MinCut_Tests.cs
          │   │   ├── Cycle
          │   │   │   └── CycleDetection_Tests.cs
          │   │   ├── Flow
          │   │   │   ├── EdmondsKarp_Tests.cs
          │   │   │   ├── FordFulkerson_Tests.cs
          │   │   │   └── PushRelabel_Tests.cs
          │   │   ├── Matching
          │   │   │   ├── BiPartiteMatching_Tests.cs
          │   │   │   └── HopcroftKarp_Tests.cs
          │   │   ├── MinimumSpanningTree
          │   │   │   ├── Kruskals_Test.cs
          │   │   │   └── Prims_Test.cs
          │   │   ├── Search
          │   │   │   ├── BiDirectional_Tests.cs
          │   │   │   ├── BreadthFirst_Tests.cs
          │   │   │   └── DepthFirst_Tests.cs
          │   │   ├── ShortestPath
          │   │   │   ├── AStar_Tests.cs
          │   │   │   ├── BellmanFord_Tests.cs
          │   │   │   ├── Dijikstras_Tests.cs
          │   │   │   ├── FloydWarshall_Tests.cs
          │   │   │   ├── Johnson_Tests.cs
          │   │   │   └── TravellingSalesman_Tests.cs
          │   │   └── Sort
          │   │       ├── DepthFirstTopSort_Tests.cs
          │   │       └── KahnTopSort_Tests.cs
          │   ├── Numerical
          │   │   ├── Exponentiation_Tests.cs
          │   │   ├── Primality_Tests.cs
          │   │   └── PrimeGenerator_Tests.cs
          │   ├── Properties
          │   │   └── AssemblyInfo.cs
          │   ├── Search
          │   │   ├── BinarySearch_Tests.cs
          │   │   ├── BoyerMoore_Tests.cs
          │   │   └── QuickSelect_Tests.cs
          │   ├── Sorting
          │   │   ├── BubbleSort_Tests.cs
          │   │   ├── BucketSort_Tests.cs
          │   │   ├── CountingSort_Tests.cs
          │   │   ├── HeapSort_Tests.cs
          │   │   ├── InsertionSort_Tests.cs
          │   │   ├── MergeSort_Tests.cs
          │   │   ├── QuickSort_Tests.cs
          │   │   ├── RadixSort_Tests.cs
          │   │   ├── SelectionSort_Tests.cs
          │   │   ├── ShellSort_Tests.cs
          │   │   └── TreeSort_Tests.cs
          │   ├── String
          │   │   ├── Manachers_Tests.cs
          │   │   └── Search
          │   │       ├── KMP_Tests.cs
          │   │       ├── RabinKarp_Tests.cs
          │   │       └── Z_Tests.cs
          │   └── StrongNameKey.snk
          └── escape.txt
  
  91 directories, 540 files