How sumaia-a-k/sa-2026 works
SA-2026 is a multilingual teaching codebase for modeling search problems and comparing search algorithms. Its principal workflow is a program entry point selecting a problem and algorithm, solving through the problem’s search interface, and printing a solution or search statistics. The graph emphasizes the sampled Java workflow and the shared core abstractions; the README documents matching Python and C++ versions and additional problem examples. Greedy and A* are described as learning topics, but corresponding implementations are not present in the supplied tree. Links between unsampled algorithm implementations and problem models are omitted where the excerpts do not establish calls.
Main entry points: Main.java Java Main · Node.java Search node · SearchAlgorithm.java Search contract · MazeProblem.java Maze model
Components 19
Program entry
- Java Main
src/sa2026/Main.java
Search core
- Problem contract
src/sa2026/core/Problem.java - Search contract
src/sa2026/core/SearchAlgorithm.java - Search node
src/sa2026/core/Node.java - State contract
src/sa2026/core/State.java - Action contract
src/sa2026/core/IAction.java
Search methods
- BFS variants
src/sa2026/algorithms/BFS.java - DFS variants
src/sa2026/algorithms/DFS.java - Depth-limited DFS
src/sa2026/algorithms/DepthLimitedDFS.java - Iterative deepening
src/sa2026/algorithms/IterativeDeepening.java - Uniform cost
src/sa2026/algorithms/UCS.java
Problem models
- Maze model
src/sa2026/problems/maze/MazeProblem.java - Maze grid
src/sa2026/problems/maze/Maze.java - City map
src/sa2026/problems/citymap/CityMapProblem.java - Road network
src/sa2026/problems/citymap/CityMap.java - N-puzzle
src/sa2026/problems/npuzzle/NpuzzleProblem.java - Word ladder
src/sa2026/problems/wordladder/WordLadderProblem.java - Word dictionary
src/sa2026/problems/wordladder/WordDictionary.java
Other components
- Student
Connections 17
- Student → Java Main: starts
README.md - Java Main → BFS variants: selects
src/sa2026/Main.java - Java Main → DFS variants: selects
src/sa2026/Main.java - Java Main → Depth-limited DFS: selects
src/sa2026/Main.java - Java Main → Iterative deepening: selects
src/sa2026/Main.java - Java Main → Uniform cost: selects
src/sa2026/Main.java - Java Main → Maze model: chooses
src/sa2026/Main.java - Java Main → City map: chooses
src/sa2026/Main.java - Java Main → N-puzzle: chooses
src/sa2026/Main.java - Java Main → Word ladder: chooses
src/sa2026/Main.java - Problem contract → Search contract: delegates search
src/sa2026/core/Problem.java - Search contract → Search node: returns result
src/sa2026/core/SearchAlgorithm.java - Search node → State contract: holds
src/sa2026/core/Node.java - Search node → Action contract: records
src/sa2026/core/Node.java - Maze model → Maze grid: uses
- City map → Road network: uses
- Word ladder → Word dictionary: uses