• Advanced.Algorithms.Binary
    • BaseConversion
    • Gcd
    • Logarithm
  • Advanced.Algorithms.Combinatorics
    • Combination
    • Permutation
    • Subset
  • Advanced.Algorithms.Compression
    • HuffmanCoding<T>
  • Advanced.Algorithms.DataStructures
    • AVLTree<T>
    • BinaryTree<T>
    • BinomialMaxHeap<T>
    • BinomialMinHeap<T>
    • BloomFilter<T>
    • BMaxHeap<T>
    • BMinHeap<T>
    • BpTree<T>
    • BST<T>
    • BTree<T>
    • CircularLinkedList<T>
    • CircularLinkedListNode<T>
    • DaryMaxHeap<T>
    • DaryMinHeap<T>
    • DisJointSet<T>
    • DoublyLinkedList<T>
    • DoublyLinkedListNode<T>
    • FenwickTree<T>
    • FibornacciMaxHeap<T>
    • FibornacciMinHeap<T>
    • IDistanceCalculator<T>
    • IntervalTree<T>
    • KDTree<T>
    • MaxPriorityQueue<T>
    • MinPriorityQueue<T>
    • PairingMaxHeap<T>
    • PairingMinHeap<T>
    • QuadTree<T>
    • RangeTree<T>
    • RedBlackTree<T>
    • RTree
    • SegmentTree<T>
    • SinglyLinkedList<T>
    • SinglyLinkedListNode<T>
    • SkipList<T>
    • SparseSet
    • SplayTree<T>
    • SuffixTree<T>
    • TernarySearchTree<T>
    • TreapTree<T>
    • Tree<T>
    • Trie<T>
  • Advanced.Algorithms.DataStructures.Foundation
    • ArrayList<T>
    • Dictionary<K, V>
    • DictionaryType
    • HashSet<T>
    • HashSetType
    • Queue<T>
    • QueueType
    • SortedDictionary<K, V>
    • SortedHashSet<T>
    • Stack<T>
    • StackType
  • Advanced.Algorithms.DataStructures.Graph.AdjacencyList
    • DiGraph<T>
    • DiGraphVertex<T>
    • Graph<T>
    • GraphVertex<T>
    • WeightedDiGraph<T, TW>
    • WeightedDiGraphVertex<T, TW>
    • WeightedGraph<T, TW>
    • WeightedGraphVertex<T, TW>
  • Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix
    • DiGraph<T>
    • Graph<T>
    • WeightedDiGraph<T, TW>
    • WeightedGraph<T, TW>
  • Advanced.Algorithms.Distributed
    • AsyncQueue<T>
    • CircularQueue<T>
    • ConsistentHash<T>
    • LRUCache<K, V>
  • Advanced.Algorithms.Geometry
    • BentleyOttmann
    • ClosestPointPair
    • ConvexHull
    • Line
    • LineExtensions
    • LineIntersection
    • Point
    • PointComparer
    • PointInsidePolygon
    • PointRotation
    • Polygon
    • Rectangle
    • RectangleComparer
    • RectangleIntersection
  • Advanced.Algorithms.Graph
    • AllPairShortestPathResult<T, W>
    • BellmanFordShortestPath<T, W>
    • BiDirectional<T>
    • BiPartiteMatching<T>
    • BreadthFirst<T>
    • Bridge<T>
    • CycleDetector<T>
    • DepthFirst<T>
    • DepthFirstTopSort<T>
    • DijikstraShortestPath<T, W>
    • EdmondKarpMaxFlow<T, W>
    • FloydWarshallShortestPath<T, W>
    • FordFulkersonMaxFlow<T, W>
    • HopcroftKarpMatching<T>
    • IBiPartiteMatchOperators<T>
    • IFlowOperators<W>
    • IJohnsonsShortestPathOperators<T, W>
    • IShortestPathOperators<W>
    • JohnsonsShortestPath<T, W>
    • KahnsTopSort<T>
    • KosarajuStronglyConnected<T>
    • Kruskals<T, TW>
    • MatchEdge<T>
    • MColorer<T, C>
    • MColorResult<T, C>
    • MinCut<T, W>
    • MinCutEdge<T>
    • MinVertexCover<T>
    • MSTEdge<T, W>
    • Prims<T, W>
    • PushRelabelMaxFlow<T, W>
    • ShortestPathResult<T, W>
    • TarjansArticulationFinder<T>
    • TarjansBiConnected<T>
    • TarjansBridgeFinder<T>
    • TarjansStronglyConnected<T>
    • TravellingSalesman
  • Advanced.Algorithms.Numerical
    • FastExponentiation
    • PrimeGenerator
    • PrimeTester
  • Advanced.Algorithms.Search
    • BinarySearch
    • BoyerMoore<T>
    • QuickSelect<T>
  • Advanced.Algorithms.Sorting
    • BubbleSort<T>
    • BucketSort
    • CountingSort
    • HeapSort<T>
    • InsertionSort<T>
    • MergeSort<T>
    • QuickSort<T>
    • RadixSort
    • SelectionSort<T>
    • ShellSort<T>
    • TreeSort<T>
  • Advanced.Algorithms.String
    • KMP
    • ManachersPalindrome
    • RabinKarp
    • ZAlgorithm