Fix CI runners and web build

Co-authored-by: COdex <codex@openai.com>

Author: thuva4

.github/workflows/test.yml

@@ -89,6 +89,9 @@ jobs:
           distribution: 'temurin'
           java-version: '21'
 
+      - name: Install Python dependencies
+        run: pip install -r tests/runners/requirements.txt
+
       - name: Run Java test runner
         run: bash tests/runners/java_runner.sh
 
@@ -254,6 +257,21 @@ jobs:
         with:
           scala-version: '3.3.1'
 
+      - name: Ensure Scala compiler is available
+        run: |
+          if ! command -v scalac >/dev/null 2>&1 || ! command -v scala >/dev/null 2>&1; then
+            if command -v cs >/dev/null 2>&1; then
+              cs install --install-dir "$HOME/.local/bin" scala scalac
+              echo "$HOME/.local/bin" >> "$GITHUB_PATH"
+              echo "$HOME/.local/share/coursier/bin" >> "$GITHUB_PATH"
+            else
+              sudo apt-get update
+              sudo apt-get install -y scala
+            fi
+          fi
+          command -v scalac
+          command -v scala
+
       - name: Run Scala test runner
         run: bash tests/runners/scala_runner.sh
 

README.md

@@ -23,6 +23,7 @@
 CACHE_DIR = REPO_ROOT / ".cache" / "go-runner"
 GO_BUILD_CACHE = REPO_ROOT / ".cache" / "go-build"
 RUN_TIMEOUT_SECONDS = float(os.environ.get("GO_RUNNER_TIMEOUT_SECONDS", "10"))
+BUILD_TIMEOUT_SECONDS = float(os.environ.get("GO_RUNNER_BUILD_TIMEOUT_SECONDS", "60"))
 
 
 @dataclass
@@ -982,14 +983,17 @@ def compile_binary(algo_dir: Path, sources: list[Path], wrapper_source: str) ->
         env["GOCACHE"] = str(GO_BUILD_CACHE)
 
         cmd = ["go", "build", "-o", str(tmp_dir / "runner")]
-        proc = subprocess.run(
-            cmd,
-            cwd=tmp_dir,
-            env=env,
-            text=True,
-            capture_output=True,
-            timeout=RUN_TIMEOUT_SECONDS,
-        )
+        try:
+            proc = subprocess.run(
+                cmd,
+                cwd=tmp_dir,
+                env=env,
+                text=True,
+                capture_output=True,
+                timeout=BUILD_TIMEOUT_SECONDS,
+            )
+        except subprocess.TimeoutExpired:
+            return None, f"Build timed out after {BUILD_TIMEOUT_SECONDS:.1f}s"
         if proc.returncode != 0:
             output = (proc.stdout + proc.stderr).strip()
             return None, output

tests/runners/go_runner.py

@@ -7,7 +7,7 @@ export class RatInMazeVisualization implements AlgorithmVisualization {
   private steps: VisualizationState[] = [];
   private currentStepIndex = -1;
 
-  initialize(data: number[]): VisualizationState {
+  initialize(_data: number[]): VisualizationState {
     this.steps = [];
     this.currentStepIndex = -1;
     const n = 4;

web/src/visualizations/backtracking/ratInMaze.ts

@@ -7,7 +7,7 @@ export class SudokuSolverVisualization implements AlgorithmVisualization {
   private steps: VisualizationState[] = [];
   private currentStepIndex = -1;
 
-  initialize(data: number[]): VisualizationState {
+  initialize(_data: number[]): VisualizationState {
     this.steps = [];
     this.currentStepIndex = -1;
     // Use a simple 4x4 Sudoku for visualization

web/src/visualizations/backtracking/sudokuSolver.ts

@@ -18,7 +18,7 @@ export class DiffieHellmanVisualization implements AlgorithmVisualization {
     return result;
   }
 
-  initialize(data: number[]): VisualizationState {
+  initialize(_data: number[]): VisualizationState {
     this.steps = [];
     this.currentStepIndex = -1;
     const p = 23; // prime

web/src/visualizations/cryptography/diffieHellman.ts

@@ -27,7 +27,6 @@ export class CuckooHashingVisualization implements AlgorithmVisualization {
 
     const tableSize = Math.max(8, data.length * 2);
     // Table A occupies indices [0, tableSize-1], Table B occupies [tableSize, 2*tableSize-1]
-    const combined = new Array(tableSize * 2).fill(0);
     const tableA: (number | null)[] = new Array(tableSize).fill(null);
     const tableB: (number | null)[] = new Array(tableSize).fill(null);
     const maxDisplacements = 10;

web/src/visualizations/data-structures/cuckooHashing.ts

@@ -43,12 +43,6 @@ export class FibonacciHeapVisualization implements AlgorithmVisualization {
       return result;
     };
 
-    const getMinIndex = (): number => {
-      if (!minNode) return -1;
-      const flat = flattenHeap();
-      return flat.indexOf(minNode.key);
-    };
-
     const getRootHighlights = (): { index: number; color: string; label?: string }[] => {
       const highlights: { index: number; color: string; label?: string }[] = [];
       let idx = 0;

web/src/visualizations/data-structures/fibonacciHeap.ts

@@ -24,11 +24,11 @@ export class MoAlgorithmVisualization implements AlgorithmVisualization {
 
     // Generate queries
     const numQueries = Math.min(6, Math.max(2, Math.floor(n / 2)));
-    const queries: { l: number; r: number; idx: number }[] = [];
+    const queries: { l: number; r: number }[] = [];
     for (let i = 0; i < numQueries; i++) {
       const l = Math.floor(Math.random() * Math.floor(n / 2));
       const r = Math.min(n - 1, l + Math.floor(Math.random() * Math.floor(n / 2)) + 1);
-      queries.push({ l, r, idx: i });
+      queries.push({ l, r });
     }
 
     this.steps.push({
@@ -86,7 +86,7 @@ export class MoAlgorithmVisualization implements AlgorithmVisualization {
     let totalOps = 0;
 
     for (let qi = 0; qi < queries.length; qi++) {
-      const { l, r, idx } = queries[qi];
+      const { l, r } = queries[qi];
 
       this.steps.push({
         data: [...arr],

web/src/visualizations/data-structures/moAlgorithm.ts

@@ -28,14 +28,6 @@ export class RopeDataStructureVisualization implements AlgorithmVisualization {
     return this.totalLength(node.left) + this.totalLength(node.right);
   }
 
-  private flatten(node: RopeNode | null): number[] {
-    if (!node) return [];
-    if (node.value !== null) {
-      return node.value.split('').map(c => c.charCodeAt(0) - 64); // A=1, B=2, etc.
-    }
-    return [...this.flatten(node.left), ...this.flatten(node.right)];
-  }
-
   private treeToArray(node: RopeNode | null): number[] {
     // BFS order of weights for visualization
     if (!node) return [];