This repo is a personal Java algorithms/workbook repository: a flat collection of standalone implementations of classic algorithms and data structures, mostly oriented around graph algorithms, dynamic programming, flow/matching, string algorithms, and competitive-programming utilities.

• Language: Java.
• Structure: mostly a single-directory repository, with many individual .java files rather than a packaged library layout.

• Shortest paths / graph traversal

  • Dijkstra.java
  • BellmanFordNegativeCycle.java
  • FloodFill.java
  • EulerianPath.java
  • MinimumCycle.java

• Graph data structures / helpers

  • Graph.java
  • Edge.java
  • EdgeWeightedGraph.java

• Flow / matching / cuts

  • Dinic.java
  • FordFulkerson.java
  • FlowEdge.java
  • FlowNetwork.java
  • MinCostMaxFlow.java
  • MaxFlowPushRelabel.java
  • HopcroftKarp.java
  • Hungarian.java
  • MaxBipartiteMatching.java
  • MinimumVertexCut.java

• Dynamic programming / classic problems

  • Knapsack.java
  • Knapsack01.java
  • LIS.java
  • LongestDecreasingSubsequences.java
  • LongestPath.java
  • JobProcessing.java

• Strings / trees / other classic algorithms

  • BWT.java
  • TrieSET.java
  • LeastCommonAncestor.java
  • PrintPostOrderFromPreOrderInOrder.java
  • WordLadder.java

• Utilities / competitive programming I/O

  • EdxIO.java
  • FasterScanner.java
  • Writer.java
  • Main.java
  • MainUsaco.java

There’s also a math/ directory, with some additional grouped math-related code.