Structural answer engine for C# codebases. Answers agent questions about call paths, interface implementations and change blast radius under a hard token budget.
Result-first data structures and algorithms for .NET 8 and .NET 10 with zero runtime dependencies: directed and weighted graphs with Dijkstra, topological sort and minimum spanning trees, AVL, red-black and binary search trees, LRU cache, trie, ring buffer, disjoint set, Fenwick and segment trees, interval tree, order statistics, Bloom filter, HyperLogLog, Count-Min Sketch, consistent hashing, 2D k-d tree, KMP, Aho-Corasick, Levenshtein, sorting, selection and randomized sampling. C# 14, nullable reference types, XML documentation for every public member, 356 tests and 100% line coverage. Recoverable failures return AlgoResult instead of throwing. Source code, documentation and issues: https://github.com/JonasWit/AlgoBag