pixi-demo/tests/chase/hexGraph.test.ts

import { describe, expect, it } from "vitest";
import {
  axialNeighbors,
  isConnected,
  shortestPathLength,
} from "../../src/game/chase/hexGraph";
import type { GameGraph } from "../../src/game/chase/types";

function buildGraph(nodes: GameGraph["nodes"]): GameGraph {
  return {
    nodes,
    edgeList: [],
  };
}

describe("hex graph utilities", () => {
  it("returns 6 axial neighbors", () => {
    const neighbors = axialNeighbors(0, 0);
    expect(neighbors).toEqual([
      [1, 0],
      [1, -1],
      [0, -1],
      [-1, 0],
      [-1, 1],
      [0, 1],
    ]);
  });

  it("finds bfs shortest path length", () => {
    const graph = buildGraph({
      A: { id: "A", q: 0, r: 0, neighbors: ["B"] },
      B: { id: "B", q: 1, r: 0, neighbors: ["A", "C"] },
      C: { id: "C", q: 2, r: 0, neighbors: ["B", "D"] },
      D: { id: "D", q: 3, r: 0, neighbors: ["C"] },
    });

    expect(shortestPathLength(graph, "A", "D")).toBe(3);
    expect(shortestPathLength(graph, "A", "A")).toBe(0);
  });

  it("returns Infinity when target is unreachable", () => {
    const graph = buildGraph({
      A: { id: "A", q: 0, r: 0, neighbors: ["B"] },
      B: { id: "B", q: 1, r: 0, neighbors: ["A"] },
      C: { id: "C", q: 5, r: 5, neighbors: [] },
    });

    expect(shortestPathLength(graph, "A", "C")).toBe(Infinity);
  });

  it("checks graph connectivity", () => {
    const connectedGraph = buildGraph({
      A: { id: "A", q: 0, r: 0, neighbors: ["B"] },
      B: { id: "B", q: 1, r: 0, neighbors: ["A", "C"] },
      C: { id: "C", q: 2, r: 0, neighbors: ["B"] },
    });

    const disconnectedGraph = buildGraph({
      A: { id: "A", q: 0, r: 0, neighbors: ["B"] },
      B: { id: "B", q: 1, r: 0, neighbors: ["A"] },
      C: { id: "C", q: 5, r: 5, neighbors: [] },
    });

    expect(isConnected(connectedGraph)).toBe(true);
    expect(isConnected(disconnectedGraph)).toBe(false);
  });
});