@monoes/monograph 1.0.0 → 1.2.0

package/src/__tests__/graph/import-chain.test.ts

@@ -0,0 +1,111 @@
+import { describe, it, expect } from 'vitest';
+import { traceImportChain } from '../../graph/import-chain.js';
+import { openDb } from '../../storage/db.js';
+import Database from 'better-sqlite3';
+import { join } from 'path';
+import { mkdtempSync } from 'fs';
+import { tmpdir } from 'os';
+
+function makeTempDb() {
+  const dir = mkdtempSync(join(tmpdir(), 'monograph-import-chain-test-'));
+  return openDb(join(dir, 'test.db'));
+}
+
+function insertNode(db: Database.Database, id: string) {
+  db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'File', ?, ?, 0)`)
+    .run(id, id, id.toLowerCase());
+}
+
+function insertEdge(db: Database.Database, src: string, tgt: string) {
+  db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'IMPORTS', 'EXTRACTED', 1.0)`)
+    .run(`${src}_${tgt}`, src, tgt);
+}
+
+describe('traceImportChain', () => {
+  it('returns empty array when source does not exist', () => {
+    const db = makeTempDb();
+    const result = traceImportChain(db, 'nonexistent', 'also-nonexistent');
+    expect(result).toEqual([]);
+    db.close();
+  });
+
+  it('returns empty array when no path exists', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a');
+    insertNode(db, 'b');
+    // no edge between them
+    const result = traceImportChain(db, 'a', 'b');
+    expect(result).toEqual([]);
+    db.close();
+  });
+
+  it('returns direct path when directly connected', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a');
+    insertNode(db, 'b');
+    insertEdge(db, 'a', 'b');
+    const result = traceImportChain(db, 'a', 'b');
+    expect(result.length).toBeGreaterThan(0);
+    expect(result[0]).toEqual(['a', 'b']);
+    db.close();
+  });
+
+  it('returns path through intermediate node a->b->c', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a');
+    insertNode(db, 'b');
+    insertNode(db, 'c');
+    insertEdge(db, 'a', 'b');
+    insertEdge(db, 'b', 'c');
+    const result = traceImportChain(db, 'a', 'c');
+    expect(result.length).toBeGreaterThan(0);
+    const hasPath = result.some(p => JSON.stringify(p) === JSON.stringify(['a', 'b', 'c']));
+    expect(hasPath).toBe(true);
+    db.close();
+  });
+
+  it('returns multiple paths when they exist', () => {
+    const db = makeTempDb();
+    // a->b->d and a->c->d
+    insertNode(db, 'a');
+    insertNode(db, 'b');
+    insertNode(db, 'c');
+    insertNode(db, 'd');
+    insertEdge(db, 'a', 'b');
+    insertEdge(db, 'a', 'c');
+    insertEdge(db, 'b', 'd');
+    insertEdge(db, 'c', 'd');
+    const result = traceImportChain(db, 'a', 'd');
+    expect(result.length).toBe(2);
+    db.close();
+  });
+
+  it('respects maxDepth option', () => {
+    const db = makeTempDb();
+    // a->b->c->d (depth 3 to reach d from a)
+    ['a', 'b', 'c', 'd'].forEach(n => insertNode(db, n));
+    insertEdge(db, 'a', 'b');
+    insertEdge(db, 'b', 'c');
+    insertEdge(db, 'c', 'd');
+    // max depth 2 should not find a->b->c->d
+    const result = traceImportChain(db, 'a', 'd', { maxDepth: 2 });
+    expect(result).toEqual([]);
+    db.close();
+  });
+
+  it('returns paths as arrays of node id strings', () => {
+    const db = makeTempDb();
+    insertNode(db, 'x');
+    insertNode(db, 'y');
+    insertEdge(db, 'x', 'y');
+    const result = traceImportChain(db, 'x', 'y');
+    expect(Array.isArray(result)).toBe(true);
+    for (const path of result) {
+      expect(Array.isArray(path)).toBe(true);
+      for (const node of path) {
+        expect(typeof node).toBe('string');
+      }
+    }
+    db.close();
+  });
+});

package/src/__tests__/graph/merge.test.ts

@@ -0,0 +1,151 @@
+import { describe, it, expect } from 'vitest';
+import { mergeGraphs, mergeGraphIntoDb } from '../../graph/merge.js';
+import { openDb } from '../../storage/db.js';
+import { join } from 'path';
+import { mkdtempSync } from 'fs';
+import { tmpdir } from 'os';
+import type { MonographNode, MonographEdge } from '../../types.js';
+
+function makeTempDb() {
+  const dir = mkdtempSync(join(tmpdir(), 'monograph-merge-test-'));
+  return openDb(join(dir, 'test.db'));
+}
+
+function makeNode(id: string, overrides: Partial<MonographNode> = {}): MonographNode {
+  return {
+    id,
+    label: 'Function',
+    name: id,
+    normLabel: id.toLowerCase(),
+    isExported: false,
+    ...overrides,
+  };
+}
+
+function makeEdge(id: string, src: string, tgt: string, overrides: Partial<MonographEdge> = {}): MonographEdge {
+  return {
+    id,
+    sourceId: src,
+    targetId: tgt,
+    relation: 'CALLS',
+    confidence: 'EXTRACTED',
+    confidenceScore: 1.0,
+    ...overrides,
+  };
+}
+
+// ── In-memory merge ────────────────────────────────────────────────────────────
+
+describe('mergeGraphs (in-memory)', () => {
+  it('merges disjoint graphs', () => {
+    const base = { nodes: [makeNode('a')], edges: [makeEdge('e1', 'a', 'b')] };
+    const incoming = { nodes: [makeNode('b'), makeNode('c')], edges: [makeEdge('e2', 'b', 'c')] };
+    const result = mergeGraphs(base, incoming);
+    expect(result.nodes).toHaveLength(3);
+    expect(result.edges).toHaveLength(2);
+    expect(result.nodesAdded).toBe(2);
+    expect(result.edgesAdded).toBe(1);
+    expect(result.nodesSkipped).toBe(0);
+    expect(result.edgesSkipped).toBe(0);
+  });
+
+  it('skips conflicting nodes/edges by default (skip strategy)', () => {
+    const nodeA = makeNode('a', { name: 'original' });
+    const base = { nodes: [nodeA], edges: [] };
+    const nodeANew = makeNode('a', { name: 'updated' });
+    const incoming = { nodes: [nodeANew], edges: [] };
+    const result = mergeGraphs(base, incoming);
+    expect(result.nodes).toHaveLength(1);
+    expect(result.nodes[0].name).toBe('original');
+    expect(result.nodesSkipped).toBe(1);
+    expect(result.nodesAdded).toBe(0);
+  });
+
+  it('replaces conflicting nodes/edges with replace strategy', () => {
+    const nodeA = makeNode('a', { name: 'original' });
+    const base = { nodes: [nodeA], edges: [] };
+    const nodeANew = makeNode('a', { name: 'updated' });
+    const incoming = { nodes: [nodeANew], edges: [] };
+    const result = mergeGraphs(base, incoming, { onConflict: 'replace' });
+    expect(result.nodes).toHaveLength(1);
+    expect(result.nodes[0].name).toBe('updated');
+    expect(result.nodesAdded).toBe(1);
+  });
+
+  it('skips conflicting edges', () => {
+    const base = { nodes: [], edges: [makeEdge('e1', 'a', 'b')] };
+    const incoming = { nodes: [], edges: [makeEdge('e1', 'a', 'c')] }; // same id, different target
+    const result = mergeGraphs(base, incoming);
+    expect(result.edges).toHaveLength(1);
+    expect(result.edges[0].targetId).toBe('b'); // original kept
+    expect(result.edgesSkipped).toBe(1);
+  });
+});
+
+// ── DB-backed merge ────────────────────────────────────────────────────────────
+
+function insertNode(db: ReturnType<typeof openDb>, id: string, name = id) {
+  db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'Function', ?, ?, 0)`)
+    .run(id, name, name.toLowerCase());
+}
+
+function insertEdge(db: ReturnType<typeof openDb>, id: string, src: string, tgt: string) {
+  db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CALLS', 'EXTRACTED', 1.0)`)
+    .run(id, src, tgt);
+}
+
+describe('mergeGraphIntoDb', () => {
+  it('inserts new nodes and edges into target db', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a');
+
+    const incoming = {
+      nodes: [makeNode('b'), makeNode('c')],
+      edges: [makeEdge('e1', 'b', 'c')],
+    };
+    const result = mergeGraphIntoDb(db, incoming);
+    expect(result.nodesAdded).toBe(2);
+    expect(result.edgesAdded).toBe(1);
+
+    const nodeCount = (db.prepare('SELECT COUNT(*) as c FROM nodes').get() as { c: number }).c;
+    expect(nodeCount).toBe(3); // a + b + c
+    db.close();
+  });
+
+  it('skips existing nodes with default strategy', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a', 'original');
+
+    const incoming = {
+      nodes: [makeNode('a', { name: 'updated' })],
+      edges: [],
+    };
+    mergeGraphIntoDb(db, incoming);
+    const row = db.prepare('SELECT name FROM nodes WHERE id = ?').get('a') as { name: string };
+    expect(row.name).toBe('original');
+    db.close();
+  });
+
+  it('replaces existing nodes with replace strategy', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a', 'original');
+
+    const incoming = {
+      nodes: [makeNode('a', { name: 'updated', normLabel: 'updated' })],
+      edges: [],
+    };
+    mergeGraphIntoDb(db, incoming, { onConflict: 'replace' });
+    const row = db.prepare('SELECT name FROM nodes WHERE id = ?').get('a') as { name: string };
+    expect(row.name).toBe('updated');
+    db.close();
+  });
+
+  it('handles empty incoming gracefully', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a');
+    const result = mergeGraphIntoDb(db, { nodes: [], edges: [] });
+    expect(result.nodesAdded).toBe(0);
+    expect(result.edgesAdded).toBe(0);
+    db.close();
+  });
+});

package/src/__tests__/graph/node-search.test.ts

@@ -0,0 +1,167 @@
+import { describe, it, expect } from 'vitest';
+import { searchNodesByProperty, searchNodesInMemory } from '../../graph/node-search.js';
+import { openDb } from '../../storage/db.js';
+import { join } from 'path';
+import { mkdtempSync } from 'fs';
+import { tmpdir } from 'os';
+import type { MonographNode } from '../../types.js';
+
+function makeTempDb() {
+  const dir = mkdtempSync(join(tmpdir(), 'monograph-node-search-test-'));
+  return openDb(join(dir, 'test.db'));
+}
+
+function insertNode(
+  db: ReturnType<typeof openDb>,
+  id: string,
+  opts: {
+    label?: string;
+    language?: string;
+    filePath?: string;
+    isExported?: boolean;
+    communityId?: number;
+  } = {},
+) {
+  db.prepare(
+    `INSERT INTO nodes (id, label, name, norm_label, file_path, is_exported, language, community_id)
+     VALUES (?, ?, ?, ?, ?, ?, ?, ?)`,
+  ).run(
+    id,
+    opts.label ?? 'Function',
+    id,
+    id.toLowerCase(),
+    opts.filePath ?? null,
+    opts.isExported ? 1 : 0,
+    opts.language ?? null,
+    opts.communityId ?? null,
+  );
+}
+
+describe('searchNodesByProperty (DB-backed)', () => {
+  it('returns all nodes when no options given', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a');
+    insertNode(db, 'b');
+    const result = searchNodesByProperty(db);
+    expect(result).toHaveLength(2);
+    db.close();
+  });
+
+  it('filters by label', () => {
+    const db = makeTempDb();
+    insertNode(db, 'f1', { label: 'Function' });
+    insertNode(db, 'c1', { label: 'Class' });
+    const result = searchNodesByProperty(db, { label: 'Class' });
+    expect(result).toHaveLength(1);
+    expect(result[0].id).toBe('c1');
+    db.close();
+  });
+
+  it('filters by language (case-insensitive)', () => {
+    const db = makeTempDb();
+    insertNode(db, 'ts1', { language: 'typescript' });
+    insertNode(db, 'py1', { language: 'python' });
+    const result = searchNodesByProperty(db, { language: 'TypeScript' });
+    expect(result).toHaveLength(1);
+    expect(result[0].id).toBe('ts1');
+    db.close();
+  });
+
+  it('filters by file extension', () => {
+    const db = makeTempDb();
+    insertNode(db, 'f1', { filePath: '/src/foo.ts' });
+    insertNode(db, 'f2', { filePath: '/src/bar.py' });
+    const result = searchNodesByProperty(db, { fileExtension: '.ts' });
+    expect(result).toHaveLength(1);
+    expect(result[0].id).toBe('f1');
+    db.close();
+  });
+
+  it('filters by file extension without leading dot', () => {
+    const db = makeTempDb();
+    insertNode(db, 'f1', { filePath: '/src/foo.ts' });
+    insertNode(db, 'f2', { filePath: '/src/bar.py' });
+    const result = searchNodesByProperty(db, { fileExtension: 'py' });
+    expect(result).toHaveLength(1);
+    expect(result[0].id).toBe('f2');
+    db.close();
+  });
+
+  it('filters by filePath substring', () => {
+    const db = makeTempDb();
+    insertNode(db, 'f1', { filePath: '/src/auth/login.ts' });
+    insertNode(db, 'f2', { filePath: '/src/utils/helper.ts' });
+    const result = searchNodesByProperty(db, { filePath: 'auth' });
+    expect(result).toHaveLength(1);
+    expect(result[0].id).toBe('f1');
+    db.close();
+  });
+
+  it('filters by isExported', () => {
+    const db = makeTempDb();
+    insertNode(db, 'exported', { isExported: true });
+    insertNode(db, 'private', { isExported: false });
+    const result = searchNodesByProperty(db, { isExported: true });
+    expect(result).toHaveLength(1);
+    expect(result[0].id).toBe('exported');
+    db.close();
+  });
+
+  it('filters by communityId', () => {
+    const db = makeTempDb();
+    insertNode(db, 'c1', { communityId: 1 });
+    insertNode(db, 'c2', { communityId: 2 });
+    insertNode(db, 'c3', { communityId: 1 });
+    const result = searchNodesByProperty(db, { communityId: 1 });
+    expect(result).toHaveLength(2);
+    db.close();
+  });
+
+  it('respects limit', () => {
+    const db = makeTempDb();
+    for (let i = 0; i < 10; i++) insertNode(db, `n${i}`);
+    const result = searchNodesByProperty(db, { limit: 3 });
+    expect(result).toHaveLength(3);
+    db.close();
+  });
+});
+
+describe('searchNodesInMemory', () => {
+  const nodes: MonographNode[] = [
+    { id: 'f1', label: 'Function', name: 'login', normLabel: 'login', filePath: '/auth/login.ts', language: 'typescript', isExported: true, communityId: 1 },
+    { id: 'f2', label: 'Class', name: 'User', normLabel: 'user', filePath: '/models/user.py', language: 'python', isExported: false, communityId: 2 },
+    { id: 'f3', label: 'Function', name: 'hash', normLabel: 'hash', filePath: '/utils/crypto.ts', language: 'typescript', isExported: true, communityId: 1 },
+  ];
+
+  it('returns all with no options', () => {
+    expect(searchNodesInMemory(nodes)).toHaveLength(3);
+  });
+
+  it('filters by label', () => {
+    expect(searchNodesInMemory(nodes, { label: 'Class' })).toHaveLength(1);
+  });
+
+  it('filters by language', () => {
+    expect(searchNodesInMemory(nodes, { language: 'Python' })).toHaveLength(1);
+  });
+
+  it('filters by fileExtension', () => {
+    expect(searchNodesInMemory(nodes, { fileExtension: '.ts' })).toHaveLength(2);
+  });
+
+  it('filters by filePath substring', () => {
+    expect(searchNodesInMemory(nodes, { filePath: 'auth' })).toHaveLength(1);
+  });
+
+  it('filters by isExported', () => {
+    expect(searchNodesInMemory(nodes, { isExported: false })).toHaveLength(1);
+  });
+
+  it('filters by communityId', () => {
+    expect(searchNodesInMemory(nodes, { communityId: 1 })).toHaveLength(2);
+  });
+
+  it('respects limit', () => {
+    expect(searchNodesInMemory(nodes, { limit: 2 })).toHaveLength(2);
+  });
+});

package/src/__tests__/graph/normalize-id.test.ts

@@ -0,0 +1,102 @@
+import { describe, it, expect } from 'vitest';
+import { normalizeId, buildNormToIdMap, reconcileEdges } from '../../graph/normalize-id.js';
+
+describe('normalizeId', () => {
+  it('lowercases the result', () => {
+    expect(normalizeId('FooBar')).toBe('foobar');
+  });
+
+  it('replaces non-alphanumeric runs with a single underscore', () => {
+    expect(normalizeId('Session_ValidateToken')).toBe('session_validatetoken');
+  });
+
+  it('collapses multiple separators', () => {
+    expect(normalizeId('My--Class::method')).toBe('my_class_method');
+  });
+
+  it('strips leading and trailing underscores', () => {
+    expect(normalizeId('_hello_')).toBe('hello');
+    expect(normalizeId('__foo__bar__')).toBe('foo_bar');
+  });
+
+  it('handles an already-clean id', () => {
+    expect(normalizeId('foo_bar_baz')).toBe('foo_bar_baz');
+  });
+
+  it('handles an empty string', () => {
+    expect(normalizeId('')).toBe('');
+  });
+});
+
+describe('buildNormToIdMap', () => {
+  it('maps normalised form to original id', () => {
+    const ids = ['Session_ValidateToken', 'auth_login', 'UserService'];
+    const map = buildNormToIdMap(ids);
+    expect(map.get('session_validatetoken')).toBe('Session_ValidateToken');
+    expect(map.get('auth_login')).toBe('auth_login');
+    expect(map.get('userservice')).toBe('UserService');
+  });
+
+  it('later entries overwrite earlier ones on collision', () => {
+    // Both normalise to 'foo'
+    const ids = ['foo', 'FOO'];
+    const map = buildNormToIdMap(ids);
+    // Last one wins
+    expect(map.get('foo')).toBe('FOO');
+  });
+});
+
+describe('reconcileEdges', () => {
+  const nodeIds = new Set(['Session_ValidateToken', 'auth_login', 'UserService']);
+
+  it('keeps edges with exact endpoint match', () => {
+    const edges = [{ source: 'Session_ValidateToken', target: 'auth_login' }];
+    const result = reconcileEdges(edges, nodeIds);
+    expect(result.resolved).toHaveLength(1);
+    expect(result.dangling).toHaveLength(0);
+    expect(result.remappedCount).toBe(0);
+  });
+
+  it('remaps edges via normalisation', () => {
+    // LLM generated "session_validatetoken" instead of "Session_ValidateToken"
+    const edges = [{ source: 'session_validatetoken', target: 'auth_login' }];
+    const result = reconcileEdges(edges, nodeIds);
+    expect(result.resolved).toHaveLength(1);
+    expect(result.resolved[0].source).toBe('Session_ValidateToken');
+    expect(result.remappedCount).toBe(1);
+  });
+
+  it('moves dangling edges to dangling list', () => {
+    const edges = [{ source: 'nonexistent', target: 'auth_login' }];
+    const result = reconcileEdges(edges, nodeIds);
+    expect(result.resolved).toHaveLength(0);
+    expect(result.dangling).toHaveLength(1);
+  });
+
+  it('handles empty edge list', () => {
+    const result = reconcileEdges([], nodeIds);
+    expect(result.resolved).toHaveLength(0);
+    expect(result.dangling).toHaveLength(0);
+    expect(result.remappedCount).toBe(0);
+  });
+
+  it('handles both endpoints requiring normalisation', () => {
+    // LLM emits ids with different casing/punctuation than the canonical form
+    // 'session_validate_token' -> normalises to 'session_validate_token' -> matches 'Session_Validate_Token'
+    // 'user--service' -> normalises to 'user_service' -> matches 'User_Service'
+    const edges = [{ source: 'session_validate_token', target: 'user_service' }];
+    const ids = new Set(['Session_Validate_Token', 'User_Service']);
+    const result = reconcileEdges(edges, ids);
+    expect(result.resolved).toHaveLength(1);
+    expect(result.resolved[0].source).toBe('Session_Validate_Token');
+    expect(result.resolved[0].target).toBe('User_Service');
+    expect(result.remappedCount).toBe(1);
+  });
+
+  it('preserves extra properties on edges', () => {
+    const edges = [{ source: 'auth_login', target: 'UserService', relation: 'CALLS', confidence: 0.9 }];
+    const result = reconcileEdges(edges, nodeIds);
+    expect(result.resolved[0].relation).toBe('CALLS');
+    expect(result.resolved[0].confidence).toBe(0.9);
+  });
+});

package/src/__tests__/graph/pagerank.test.ts

@@ -0,0 +1,96 @@
+import { describe, it, expect } from 'vitest';
+import { pageRank } from '../../graph/pagerank.js';
+import { openDb } from '../../storage/db.js';
+import Database from 'better-sqlite3';
+import { join } from 'path';
+import { mkdtempSync } from 'fs';
+import { tmpdir } from 'os';
+
+function makeTempDb() {
+  const dir = mkdtempSync(join(tmpdir(), 'monograph-pagerank-test-'));
+  return openDb(join(dir, 'test.db'));
+}
+
+function insertNode(db: Database.Database, id: string) {
+  db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'Function', ?, ?, 0)`)
+    .run(id, id, id.toLowerCase());
+}
+
+function insertEdge(db: Database.Database, src: string, tgt: string) {
+  db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CALLS', 'EXTRACTED', 1.0)`)
+    .run(`${src}_${tgt}`, src, tgt);
+}
+
+describe('pageRank', () => {
+  it('returns empty map for empty graph', () => {
+    const db = makeTempDb();
+    const result = pageRank(db);
+    expect(result.size).toBe(0);
+    db.close();
+  });
+
+  it('returns score 1.0 for single node (normalized)', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a');
+    const result = pageRank(db);
+    expect(result.size).toBe(1);
+    expect(result.get('a')).toBeCloseTo(1.0, 2);
+    db.close();
+  });
+
+  it('returns scores that sum to approximately 1.0', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a');
+    insertNode(db, 'b');
+    insertNode(db, 'c');
+    insertEdge(db, 'a', 'b');
+    insertEdge(db, 'b', 'c');
+    const result = pageRank(db);
+    const sum = [...result.values()].reduce((acc, v) => acc + v, 0);
+    // sum of all scores should equal approximately 1.0 (probability distribution)
+    expect(sum).toBeCloseTo(1.0, 1);
+    db.close();
+  });
+
+  it('gives higher rank to nodes with more incoming edges', () => {
+    const db = makeTempDb();
+    // hub: a, b, c all point to d
+    insertNode(db, 'a');
+    insertNode(db, 'b');
+    insertNode(db, 'c');
+    insertNode(db, 'd');
+    insertEdge(db, 'a', 'd');
+    insertEdge(db, 'b', 'd');
+    insertEdge(db, 'c', 'd');
+    const result = pageRank(db);
+    const rankD = result.get('d') ?? 0;
+    const rankA = result.get('a') ?? 0;
+    expect(rankD).toBeGreaterThan(rankA);
+    db.close();
+  });
+
+  it('returns Map<string, number>', () => {
+    const db = makeTempDb();
+    insertNode(db, 'x');
+    insertNode(db, 'y');
+    insertEdge(db, 'x', 'y');
+    const result = pageRank(db);
+    expect(result instanceof Map).toBe(true);
+    for (const [k, v] of result) {
+      expect(typeof k).toBe('string');
+      expect(typeof v).toBe('number');
+      expect(v).toBeGreaterThan(0);
+    }
+    db.close();
+  });
+
+  it('accepts custom damping factor and iterations', () => {
+    const db = makeTempDb();
+    insertNode(db, 'a');
+    insertNode(db, 'b');
+    insertEdge(db, 'a', 'b');
+    const result = pageRank(db, { dampingFactor: 0.5, maxIterations: 20 });
+    expect(result.size).toBe(2);
+    db.close();
+  });
+});