How williamfiset/algorithms works
This repository is a teaching collection of standalone data-structure and algorithm implementations, not a single application. The principal workflow is that a programmer chooses an implementation, invokes its API or example entry point, and observes a computed result. Its major branches cover data structures, graph algorithms, dynamic programming, geometry, algebra, math, searching, sorting, and strings. Edges are limited to documented invocation and relationships visible in the supplied excerpts or SOURCE INDEX; unsampled implementations are represented at their existing directory paths.
Main entry points: BinarySearchTree.java Binary search tree · FibonacciHeap.java Fibonacci heap · Queue.java Queue interface · Stack.java Stack interface
Components 27
Data structures
- AVL tree
src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java - Binary search tree
src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java - Traversal order
src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/TreeTraversalOrder.java - Dynamic array
src/main/java/com/williamfiset/algorithms/datastructures/dynamicarray/IntArray.java - Fenwick trees
src/main/java/com/williamfiset/algorithms/datastructures/fenwicktree - Fibonacci heap
src/main/java/com/williamfiset/algorithms/datastructures/fibonacciheap/FibonacciHeap.java - Queue interface
src/main/java/com/williamfiset/algorithms/datastructures/queue/Queue.java - Segment trees
src/main/java/com/williamfiset/algorithms/datastructures/segmenttree - Pointer segment tree
src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/Node.java - Sum segment tree
src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java - Multiplication updates
src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java - Stack interface
src/main/java/com/williamfiset/algorithms/datastructures/stack/Stack.java - Suffix arrays
src/main/java/com/williamfiset/algorithms/datastructures/suffixarray - Quad tree
src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java
Graph algorithms
- Graph algorithms
src/main/java/com/williamfiset/algorithms/graphtheory - Prim analysis
src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java - Flow solver base
src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java - Min-cost flow
src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowWithBellmanFord.java - Tree algorithms
src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms
Optimization
- Dynamic programming
src/main/java/com/williamfiset/algorithms/dp - Geometry
src/main/java/com/williamfiset/algorithms/geometry
Core computing
- Linear algebra
src/main/java/com/williamfiset/algorithms/linearalgebra - Mathematics
src/main/java/com/williamfiset/algorithms/math
Sequence algorithms
- Searching
src/main/java/com/williamfiset/algorithms/search - Sorting
src/main/java/com/williamfiset/algorithms/sorting - String algorithms
src/main/java/com/williamfiset/algorithms/strings
Other components
- Programmer
Connections 10
- Programmer → Searching: runs implementation
- Programmer → Binary search tree: uses implementation
- Binary search tree → Traversal order: uses traversal order
src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java - Binary search tree → Queue interface: uses queue
src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java - AVL tree → Stack interface: uses stack
src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java - Fibonacci heap → Queue interface: uses queue
src/main/java/com/williamfiset/algorithms/datastructures/fibonacciheap/FibonacciHeap.java - Fibonacci heap → Stack interface: uses stack
src/main/java/com/williamfiset/algorithms/datastructures/fibonacciheap/FibonacciHeap.java - Prim analysis → Searching: benchmarks Prim
src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java - Min-cost flow → Flow solver base: extends solver
src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowWithBellmanFord.java - Multiplication updates → Sum segment tree: example constructs
src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java