Skip to content

0.0.110

Choose a tag to compare

View all tags
@justcoding121 justcoding121 released this 19 Oct 23:31
0.0.110
3806a12

What's Changed

Features

  • Initial release of Advanced Algorithms — a C# library of data structures and classic algorithms
  • Core collections: ArrayList, linked lists (singly/doubly/circular), Queue, Stack, HashTable, HashSet, StringBuilder, Priority Queue
  • Heaps: binary min/max heap, d-ary heap, Binomial heap, Fibonacci heap, Pairing heap (with decrement-key and performance work)
  • Balanced trees: BST, AVL, Red-Black, Splay, Treap, B-Tree, B+ Tree (including sorted enumeration and min/max APIs)
  • Spatial / range structures: Interval Tree, Kd-Tree, Range Tree, Segment Tree
  • String indexes: Trie, Suffix Tree, Ternary Search Tree, Fenwick Tree
  • Skip List and TreeHashSet
  • Graph foundations: adjacency representations, adjacency-matrix graph, get-edges API, Disjoint Set (Union-Find)
  • Graph algorithms: BFS/DFS, cycle detection, Dijkstra, Bellman-Ford, Floyd-Warshall, Johnson's all-pairs shortest paths
  • Max flow & matching: Ford-Fulkerson, Push-Relabel, Hopcroft-Karp
  • Connectivity & spanning trees: Tarjan, Kosaraju (SCCs), Prim and Kruskal MST
  • Graph coloring (m-coloring)
  • Sorting: Quick, Merge, Heap, Tree, Shell, Counting, Radix, Bucket; Tree Sort
  • Searching: binary search, almost-sorted search, zigzag ordering, kth smallest / order statistics
  • String matching: KMP, Z-algorithm, Rabin-Karp; Huffman coding
  • Dynamic programming suite: LIS, LCS/palindrome variants, knapsack/subset-sum style problems, matrix chain / path problems, egg drop, rod cutting, job scheduling, assembly line, edit distance, array jump, TSP, wildcard matching, word break, text justification, optimal BST/game strategy, and related DP classics
  • Combinatorics: permutations, combinations, variations, subsets
  • Bit algorithms and numeric helpers: bit tricks, GCD, logarithms, base conversion, primes, Manacher's longest palindrome
  • Computational geometry: convex hull (Jarvis), line intersection, closest pair, polygon containment, rectangle intersection, point rotation
  • Bloom filter and Sparse Set
  • .NET Standard support

Fixes

  • Hardened tree/heap edge cases (AVL/Red-Black deletion, B/B+ Tree insert/delete, Fibonacci/Pairing heap decrement-key, Kd-Tree nearest neighbor, Interval Tree, HashSet/HashTable)

Docs

  • README catalog of implemented algorithms and data structures

Full Changelog: https://github.com/justcoding121/advanced-algorithms/commits/0.0.110

Assets 3
Loading