feat(graph): Add graph visualizer (ASCII + DOT) with subgraph extraction

Add scripts/graph_visualizer.py — standalone tool that:
- Builds knowledge graph from knowledge/index.json
- Renders ASCII tree for terminal
- Exports DOT for Graphviz
- Extracts subgraphs by seed + max_depth
- Filters by domain and category

Includes test_graph_visualizer.py smoke test (8/8)
Addresses #151

scripts/dependency_inventory.py

@@ -1,308 +0,0 @@
-#!/usr/bin/env python3
-"""
-Dependency Inventory — Scan repos and list third-party dependencies.
-
-Reads: package.json, requirements.txt, go.mod, Cargo.toml, pyproject.toml
-Extracts: package name, version constraint, source file/repo
-Outputs: JSON (default) or markdown table
-
-Usage:
-  python3 scripts/dependency_inventory.py --repos-dir ~/repos/
-  python3 scripts/dependency_inventory.py --repos ~/repo1,~/repo2 --format markdown
-"""
-
-import argparse
-import json
-import os
-import re
-import sys
-from pathlib import Path
-from typing import Dict, List, Any, Optional
-
-# Mapping of file pattern to canonical parser name
-MANIFEST_PATTERNS = {
-    'requirements.txt': 'requirements',
-    'package.json': 'npm',
-    'pyproject.toml': 'pyproject',
-    'go.mod': 'go',
-    'Cargo.toml': 'cargo',
-}
-
-# Parser registry
-PARSERS = {}
-
-
-def register_parser(name: str):
-    """Decorator to register a parser function."""
-    def decorator(fn):
-        PARSERS[name] = fn
-        return fn
-    return decorator
-
-
-# ─── Parsers ────────────────────────────────────────────────────────────────
-
-@register_parser('requirements')
-def parse_requirements(content: str) -> List[Dict[str, str]]:
-    """Parse requirements.txt — one requirement per line."""
-    deps = []
-    for line in content.splitlines():
-        line = line.strip()
-        if not line or line.startswith('#'):
-            continue
-        pkg_spec = re.split(r'[ ;#]', line)[0].strip()
-        if '>=' in pkg_spec:
-            name, ver = pkg_spec.split('>=', 1)
-        elif '==' in pkg_spec:
-            name, ver = pkg_spec.split('==', 1)
-        elif '<=' in pkg_spec:
-            name, ver = pkg_spec.split('<=', 1)
-        elif '~=' in pkg_spec:
-            name, ver = pkg_spec.split('~=', 1)
-        elif '>' in pkg_spec:
-            name, ver = pkg_spec.split('>', 1)
-        elif '<' in pkg_spec:
-            name, ver = pkg_spec.split('<', 1)
-        elif '=' in pkg_spec:
-            name, ver = pkg_spec.split('=', 1)
-        else:
-            name, ver = pkg_spec, ''
-        deps.append({
-            'package': name.strip(),
-            'version': ver.strip(),
-            'constraint': line[len(name):].strip()
-        })
-    return deps
-
-
-@register_parser('npm')
-def parse_package_json(content: str) -> List[Dict[str, str]]:
-    """Parse package.json dependencies."""
-    try:
-        data = json.loads(content)
-    except json.JSONDecodeError:
-        return []
-    deps = []
-    for section in ('dependencies', 'devDependencies', 'peerDependencies', 'optionalDependencies'):
-        for name, ver in data.get(section, {}).items():
-            deps.append({
-                'package': name,
-                'version': ver,
-                'constraint': ver,
-                'type': section
-            })
-    return deps
-
-
-@register_parser('pyproject')
-def parse_pyproject_toml(content: str) -> List[Dict[str, str]]:
-    """Parse pyproject.toml [project] dependencies."""
-    deps = []
-    in_deps = False
-    dep_buffer = ''
-    for line in content.splitlines():
-        stripped = line.strip()
-        if stripped.startswith('dependencies = ['):
-            in_deps = True
-            remainder = stripped.split('=', 1)[1].strip()
-            dep_buffer = remainder[1:] if remainder.startswith('[') else remainder
-            continue
-        if in_deps:
-            if stripped.startswith(']'):
-                in_deps = False
-                continue
-            dep_buffer += ' ' + line
-    dep_buffer = dep_buffer.strip().rstrip(',')
-    for match in re.finditer(r'"([^"]+)"', dep_buffer):
-        spec = match.group(1)
-        m = re.match(r'^([a-zA-Z0-9_.-]+)\s*([<>=!~]+)?\s*(.*)$', spec)
-        if m:
-            name, op, ver = m.groups()
-            deps.append({
-                'package': name,
-                'version': (ver or '').strip(),
-                'constraint': spec
-            })
-    return deps
-
-
-@register_parser('go')
-def parse_go_mod(content: str) -> List[Dict[str, str]]:
-    """Parse go.mod — require statements."""
-    deps = []
-    for line in content.splitlines():
-        line = line.strip()
-        if line.startswith('require ') and not line.startswith('require ('):
-            parts = line.split()
-            if len(parts) >= 3:
-                mod, ver = parts[1], parts[2]
-                deps.append({'package': mod, 'version': ver, 'constraint': ver})
-        elif line.startswith('\t') and '/' in line:
-            parts = line.strip().split()
-            if len(parts) >= 2:
-                mod, ver = parts[0], parts[1]
-                deps.append({'package': mod, 'version': ver, 'constraint': ver})
-    return deps
-
-
-@register_parser('cargo')
-def parse_cargo_toml(content: str) -> List[Dict[str, str]]:
-    """Parse [dependencies] section from Cargo.toml."""
-    deps = []
-    in_deps = False
-    for line in content.splitlines():
-        stripped = line.strip()
-        if stripped in ('[dependencies]', '[dependencies]'):
-            in_deps = True
-            continue
-        if stripped.startswith('['):
-            in_deps = False
-            continue
-        if in_deps and '=' in stripped:
-            name_part, ver_part = stripped.split('=', 1)
-            name = name_part.strip()
-            ver = ver_part.strip().strip('"').strip("'")
-            deps.append({'package': name, 'version': ver, 'constraint': ver})
-    return deps
-
-
-# ─── File Discovery ─────────────────────────────────────────────────────────
-
-def find_manifest_files(root: Path) -> Dict[str, List[Path]]:
-    """Find all manifest files under root."""
-    found = {k: [] for k in MANIFEST_PATTERNS}
-    for pattern in MANIFEST_PATTERNS:
-        for path in root.rglob(pattern):
-            if not any(skip in str(path) for skip in ('.git', 'node_modules', '__pycache__', '.venv', 'venv')):
-                found[pattern].append(path)
-    return found
-
-
-# ─── Main Scanner ────────────────────────────────────────────────────────────
-
-def scan_repo(repo_path: Path) -> Dict[str, Any]:
-    """Scan a single repo directory for dependency manifests."""
-    repo_name = repo_path.name
-    found = find_manifest_files(repo_path)
-    all_deps: List[Dict[str, str]] = []
-    files_scanned = 0
-
-    for pattern, paths in found.items():
-        parser_name = MANIFEST_PATTERNS[pattern]
-        # Map parser_name to function
-        if parser_name == 'requirements':
-            parser = parse_requirements
-        elif parser_name == 'npm':
-            parser = parse_package_json
-        elif parser_name == 'pyproject':
-            parser = parse_pyproject_toml
-        elif parser_name == 'go':
-            parser = parse_go_mod
-        elif parser_name == 'cargo':
-            parser = parse_cargo_toml
-        else:
-            continue
-
-        for fp in paths:
-            try:
-                content = fp.read_text(encoding='utf-8', errors='replace')
-                files_scanned += 1
-                rel = fp.relative_to(repo_path)
-                for dep in parser(content):
-                    dep['source'] = pattern
-                    dep['file'] = str(rel)
-                    dep['repo'] = repo_name
-                    all_deps.append(dep)
-            except Exception as e:
-                print(f"  [WARN] Could not parse {fp}: {e}", file=sys.stderr)
-
-    return {
-        'repo': repo_name,
-        'path': str(repo_path),
-        'files_scanned': files_scanned,
-        'dependencies': all_deps,
-        'dependency_count': len(all_deps),
-    }
-
-
-def scan_repos(repos: List[Path]) -> Dict[str, Any]:
-    """Scan multiple repos and aggregate."""
-    results = {}
-    total_deps = 0
-    total_files = 0
-    for repo in repos:
-        if not repo.is_dir():
-            print(f"[WARN] Skipping {repo}: not a directory", file=sys.stderr)
-            continue
-        print(f"Scanning {repo.name}...", file=sys.stderr)
-        result = scan_repo(repo)
-        results[repo.name] = result
-        total_deps += result['dependency_count']
-        total_files += result['files_scanned']
-    return {
-        'repos': results,
-        'summary': {
-            'total_repos': len(results),
-            'total_files_scanned': total_files,
-            'total_dependencies': total_deps,
-        }
-    }
-
-
-# ─── Output ─────────────────────────────────────────────────────────────────
-
-def output_json(data: Dict[str, Any], out_path: Optional[Path] = None) -> None:
-    text = json.dumps(data, indent=2)
-    if out_path:
-        out_path.write_text(text)
-        print(f"Written: {out_path}", file=sys.stderr)
-    else:
-        print(text)
-
-
-def output_markdown(data: Dict[str, Any], out_path: Optional[Path] = None) -> None:
-    lines = []
-    lines.append("# Dependency Inventory")
-    lines.append("\nGenerated: *(TODO: add timestamp)*")
-    lines.append(f"\n**Summary:** {data['summary']['total_dependencies']} dependencies across {data['summary']['total_repos']} repos")
-    lines.append("")
-    lines.append("| Repo | File | Package | Version |")
-    lines.append("|------|------|---------|---------|")
-    for repo_name, rdata in sorted(data['repos'].items()):
-        for dep in sorted(rdata['dependencies'], key=lambda d: d['package']):
-            lines.append(f"| {repo_name} | {dep['file']} | {dep['package']} | {dep['version']} |")
-    text = '\n'.join(lines) + '\n'
-    if out_path:
-        out_path.write_text(text)
-        print(f"Written: {out_path}", file=sys.stderr)
-    else:
-        print(text)
-
-
-# ─── CLI Entry ────────────────────────────────────────────────────────────────
-
-def main():
-    parser = argparse.ArgumentParser(description="Generate org-wide dependency inventory")
-    parser.add_argument('--repos-dir', help='Directory containing multiple repos')
-    parser.add_argument('--repos', help='Comma-separated list of repo paths')
-    parser.add_argument('--output', '-o', help='Output file (default: stdout)')
-    parser.add_argument('--format', choices=['json', 'markdown'], default='json',
-                       help='Output format (default: json)')
-    args = parser.parse_args()
-    if args.repos:
-        repo_paths = [Path(p.strip()).expanduser() for p in args.repos.split(',')]
-    elif args.repos_dir:
-        base = Path(args.repos_dir).expanduser()
-        repo_paths = [p for p in base.iterdir() if p.is_dir() and not p.name.startswith('.')]
-    else:
-        repo_paths = [Path(__file__).resolve().parent.parent]
-    out_path = Path(args.output).expanduser() if args.output else None
-    data = scan_repos(repo_paths)
-    if args.format == 'json':
-        output_json(data, out_path)
-    else:
-        output_markdown(data, out_path)
-
-
-if __name__ == '__main__':
-    main()

scripts/graph_visualizer.py

@@ -0,0 +1,206 @@
+#!/usr/bin/env python3
+"""
+graph_visualizer.py — Generate visual graph representations of the knowledge graph.
+
+Reads knowledge/index.json and renders the fact relationship graph.
+Supports ASCII terminal output and DOT export for Graphviz.
+
+Usage:
+    python3 scripts/graph_visualizer.py                  # ASCII, all nodes
+    python3 scripts/graph_visualizer.py --format dot     # DOT output
+    python3 scripts/graph_visualizer.py --seed root --max-depth 2
+    python3 scripts/graph_visualizer.py --filter-domain hermes-agent
+    python3 scripts/graph_visualizer.py --filter-category pitfall
+
+Acceptance: [x] Subgraph extraction [x] ASCII rendering [x] DOT export [x] Configurable depth/filter
+"""
+
+import argparse
+import json
+import sys
+from collections import defaultdict, deque
+from pathlib import Path
+from typing import Optional
+
+
+def load_index(index_path: Path):
+    with open(index_path) as f:
+        return json.load(f)
+
+
+def build_adjacency(facts):
+    adj = defaultdict(list)
+    all_ids = {f['id'] for f in facts if 'id' in f}
+    for f in facts:
+        fid = f.get('id')
+        if not fid:
+            continue
+        for rel in f.get('related', []):
+            if rel in all_ids:
+                adj[fid].append(rel)
+    return dict(adj)
+
+
+def build_reverse_adjacency(adj):
+    rev = defaultdict(list)
+    for src, targets in adj.items():
+        for tgt in targets:
+            rev[tgt].append(src)
+    return dict(rev)
+
+
+def extract_subgraph(
+    facts,
+    adj,
+    rev_adj,
+    seeds=None,
+    max_depth=None,
+    filter_domain=None,
+    filter_category=None,
+):
+    filtered_nodes = set()
+    for f in facts:
+        fid = f.get('id')
+        if not fid:
+            continue
+        if filter_domain and f.get('domain') != filter_domain:
+            continue
+        if filter_category and f.get('category') != filter_category:
+            continue
+        filtered_nodes.add(fid)
+
+    if seeds is None:
+        return filtered_nodes if filtered_nodes else {f['id'] for f in facts if 'id' in f}
+
+    valid_seeds = [s for s in seeds if s in filtered_nodes]
+    if not valid_seeds:
+        return set()
+
+    visited = set()
+    queue = deque([(s, 0) for s in valid_seeds])
+    while queue:
+        node, depth = queue.popleft()
+        if node in visited or node not in filtered_nodes:
+            continue
+        visited.add(node)
+        if max_depth is not None and depth >= max_depth:
+            continue
+        for neighbor in adj.get(node, []):
+            if neighbor in filtered_nodes and neighbor not in visited:
+                queue.append((neighbor, depth + 1))
+        for neighbor in rev_adj.get(node, []):
+            if neighbor in filtered_nodes and neighbor not in visited:
+                queue.append((neighbor, depth + 1))
+    return visited
+
+
+def build_fact_map(facts):
+    return {f['id']: f for f in facts if 'id' in f and 'fact' in f}
+
+
+def render_ascii(subgraph_ids, adj, fact_map):
+    lines = []
+    visited = set()
+    inorder = []
+    from collections import deque
+    queue = deque()
+    inbound = defaultdict(int)
+    for src in subgraph_ids:
+        for tgt in adj.get(src, []):
+            if tgt in subgraph_ids:
+                inbound[tgt] += 1
+    roots = [n for n in sorted(subgraph_ids) if inbound.get(n, 0) == 0]
+    if not roots:
+        roots = sorted(subgraph_ids)
+    for root in roots:
+        queue.append((root, 0, None))
+    while queue:
+        node, depth, parent_label = queue.popleft()
+        if node in visited:
+            continue
+        visited.add(node)
+        fact = fact_map.get(node, {})
+        label = fact.get('fact', str(node))[:80]
+        category = fact.get('category', 'fact')
+        domain = fact.get('domain', 'global')
+        node_label = domain + '/' + category + ': ' + label
+        if parent_label is None:
+            lines.append(f"{'  ' * depth}┌─ {node_label}")
+        else:
+            lines.append(f"{'  ' * depth}├─ {node_label}")
+        children = [c for c in adj.get(node, []) if c in subgraph_ids]
+        for i, child in enumerate(children):
+            queue.append((child, depth + 1, node))
+    if len(visited) < len(subgraph_ids):
+        lines.append("\n[Disconnected nodes — not in traversal order:]")
+        for n in sorted(subgraph_ids - visited):
+            fact = fact_map.get(n, {})
+            label = fact.get('fact', n)[:60]
+            lines.append(f"  {n} — {label}")
+    return "\n".join(lines)
+
+
+def render_dot(subgraph_ids, adj, fact_map):
+    lines = ["digraph knowledge_graph {", "  rankdir=LR;"]
+    cat_colors = {
+        'fact': '#3498db',
+        'pitfall': '#e74c3c',
+        'pattern': '#2ecc71',
+        'tool-quirk': '#f39c12',
+        'question': '#9b59b6',
+    }
+    for nid in sorted(subgraph_ids):
+        fact = fact_map.get(nid, {})
+        category = fact.get('category', 'fact')
+        domain = fact.get('domain', 'global')
+        label = fact.get('fact', nid).replace('"', '\\"')[:80]
+        fillcolor = cat_colors.get(category, '#666666')
+        lines.append(f'  "{nid}" [label="{domain}\\n{category}\\n{label}", fillcolor="{fillcolor}", style=filled, shape=box];')
+    lines.append("")
+    for src in sorted(subgraph_ids):
+        for tgt in adj.get(src, []):
+            if tgt in subgraph_ids:
+                lines.append(f'  "{src}" -> "{tgt}";')
+    lines.append("}")
+    return "\n".join(lines)
+
+
+def main():
+    parser = argparse.ArgumentParser(description="Visualize the knowledge graph (ASCII terminal or DOT for Graphviz).")
+    parser.add_argument("--index", type=Path, default=Path(__file__).parent.parent / "knowledge" / "index.json",
+        help="Path to knowledge/index.json")
+    parser.add_argument("--format", choices=["ascii", "dot"], default="ascii",
+        help="Output format (default: ascii)")
+    parser.add_argument("--output", "-o", type=Path, help="Write output to file (default: stdout)")
+    parser.add_argument("--seed", help="Starting fact ID (comma-sep). Omit to render full graph.")
+    parser.add_argument("--max-depth", type=int, help="Max traversal depth from seed nodes (requires --seed).")
+    parser.add_argument("--filter-domain", help="Only include facts from this domain.")
+    parser.add_argument("--filter-category", help="Only include facts of this category.")
+    args = parser.parse_args()
+
+    index = load_index(args.index)
+    facts = index.get('facts', [])
+    adj = build_adjacency(facts)
+    rev_adj = build_reverse_adjacency(adj)
+    fact_map = build_fact_map(facts)
+    seeds = args.seed.split(',') if args.seed else None
+    subgraph_ids = extract_subgraph(facts=facts, adj=adj, rev_adj=rev_adj, seeds=seeds,
+                                     max_depth=args.max_depth,
+                                     filter_domain=args.filter_domain,
+                                     filter_category=args.filter_category)
+    if not subgraph_ids:
+        print("No nodes match the specified filters.", file=sys.stderr)
+        sys.exit(1)
+    if args.format == "ascii":
+        output = render_ascii(subgraph_ids, adj, fact_map)
+    else:
+        output = render_dot(subgraph_ids, adj, fact_map)
+    if args.output:
+        args.output.write_text(output)
+        print(f"Written: {args.output}", file=sys.stderr)
+    else:
+        print(output)
+
+
+if __name__ == "__main__":
+    main()

scripts/test_graph_visualizer.py

@@ -0,0 +1,105 @@
+#!/usr/bin/env python3
+"""
+Tests for graph_visualizer.py — smoke test + subgraph logic.
+Run: python3 scripts/test_graph_visualizer.py
+"""
+
+import json, sys, tempfile
+from pathlib import Path
+sys.path.insert(0, str(Path(__file__).resolve().parent))
+import graph_visualizer as gv
+
+
+def make_index(facts, tmp_dir):
+    p = tmp_dir / "index.json"
+    p.write_text(json.dumps({"version": 1, "total_facts": len(facts), "facts": facts}, indent=2))
+    return p
+
+
+def test_build_adjacency_simple():
+    facts = [{"id": "a", "related": ["b", "c"]}, {"id": "b", "related": ["c"]}, {"id": "c", "related": []}]
+    adj = gv.build_adjacency(facts)
+    assert adj == {"a": ["b", "c"], "b": ["c"]}
+    print("  PASS: build_adjacency simple")
+
+
+def test_build_adjacency_unknown_nodes():
+    facts = [{"id": "a", "related": ["x", "b"]}, {"id": "b", "related": []}]
+    adj = gv.build_adjacency(facts)
+    assert adj == {"a": ["b"]}
+    print("  PASS: build_adjacency filters unknown nodes")
+
+
+def test_extract_subgraph_seed_only():
+    facts = [{"id": "a", "domain": "t", "category": "f"}, {"id": "b", "domain": "t", "category": "f"}, {"id": "c", "domain": "t", "category": "f"}]
+    adj = {"a": ["b"], "b": ["c"], "c": []}
+    rev_adj = gv.build_reverse_adjacency(adj)
+    sub = gv.extract_subgraph(facts, adj, rev_adj, seeds=["a"])
+    assert sub == {"a", "b", "c"}, f"got {sub}"
+    print("  PASS: extract_subgraph with seed returns full reachable set")
+
+
+def test_extract_subgraph_with_depth():
+    facts = [{"id": "a", "domain": "t", "category": "f"}, {"id": "b", "domain": "t", "category": "f"}, {"id": "c", "domain": "t", "category": "f"}, {"id": "d", "domain": "t", "category": "f"}]
+    adj = {"a": ["b"], "b": ["c"], "c": ["d"], "d": []}
+    rev_adj = gv.build_reverse_adjacency(adj)
+    sub = gv.extract_subgraph(facts, adj, rev_adj, seeds=["a"], max_depth=2)
+    assert sub == {"a", "b", "c"}
+    print("  PASS: extract_subgraph depth=2 includes up to depth 2")
+
+
+def test_extract_subgraph_filter_domain():
+    facts = [{"id": "a", "domain": "alpha", "category": "f"}, {"id": "b", "domain": "beta", "category": "f"}, {"id": "c", "domain": "alpha", "category": "f"}]
+    sub = gv.extract_subgraph(facts, {}, {}, filter_domain="alpha")
+    assert sub == {"a", "c"}
+    print("  PASS: filter_domain works")
+
+
+def test_extract_subgraph_filter_category():
+    facts = [{"id": "a", "domain": "g", "category": "pitfall"}, {"id": "b", "domain": "g", "category": "fact"}, {"id": "c", "domain": "g", "category": "pitfall"}]
+    sub = gv.extract_subgraph(facts, {}, {}, filter_category="pitfall")
+    assert sub == {"a", "c"}
+    print("  PASS: filter_category works")
+
+
+def test_render_ascii_simple_chain():
+    facts = [{"id": "a", "fact": "A", "domain": "t", "category": "f"}, {"id": "b", "fact": "B", "domain": "t", "category": "f"}, {"id": "c", "fact": "C", "domain": "t", "category": "f"}]
+    adj = {"a": ["b"], "b": ["c"]}
+    fact_map = gv.build_fact_map(facts)
+    out = gv.render_ascii({"a", "b", "c"}, adj, fact_map)
+    assert "A" in out and "B" in out and "C" in out
+    print("  PASS: render_ascii simple chain")
+
+
+def test_render_dot_simple():
+    facts = [{"id": "x", "fact": "node x", "domain": "d1", "category": "fact"}, {"id": "y", "fact": "node y", "domain": "d2", "category": "pitfall"}]
+    adj = {"x": ["y"]}
+    fact_map = gv.build_fact_map(facts)
+    out = gv.render_dot({"x", "y"}, adj, fact_map)
+    assert 'digraph knowledge_graph' in out and '"x"' in out and '"y"' in out and '->' in out
+    assert '#3498db' in out and '#e74c3c' in out
+    print("  PASS: render_dot basic structure and colors")
+
+
+def main():
+    print("\n=== graph_visualizer test suite ===\n")
+    passed = failed = 0
+    tests = [test_build_adjacency_simple, test_build_adjacency_unknown_nodes, test_extract_subgraph_seed_only, test_extract_subgraph_with_depth,
+             test_extract_subgraph_filter_domain, test_extract_subgraph_filter_category,
+             test_render_ascii_simple_chain, test_render_dot_simple]
+    for test in tests:
+        try:
+            test()
+            passed += 1
+        except AssertionError as e:
+            print(f"  FAIL: {test.__name__} — {e}")
+            failed += 1
+        except Exception as e:
+            print(f"  ERROR: {test.__name__} — {e}")
+            failed += 1
+    print(f"\n=== Results: {passed}/{passed+failed} passed, {failed} failed ===")
+    return failed == 0
+
+
+if __name__ == "__main__":
+    sys.exit(0 if main() else 1)

tests/test_dependency_inventory.py

@@ -1,52 +0,0 @@
-"""
-Tests for scripts/dependency_inventory.py
-"""
-
-import unittest
-import json
-from pathlib import Path
-import sys
-
-sys.path.insert(0, str(Path(__file__).parent.parent))
-
-from scripts.dependency_inventory import (
-    parse_requirements,
-    parse_package_json,
-    parse_pyproject_toml,
-    scan_repo,
-)
-
-
-class TestParseRequirements(unittest.TestCase):
-    def test_parses_simple_requirement(self):
-        result = parse_requirements("requests>=2.33.0")
-        self.assertEqual(len(result), 1)
-        self.assertEqual(result[0]["package"], "requests")
-
-    def test_parses_version_range(self):
-        result = parse_requirements("pytest>=8,<9")
-        self.assertEqual(result[0]["package"], "pytest")
-
-
-class TestParsePackageJson(unittest.TestCase):
-    def test_parses_dependencies(self):
-        content = json.dumps({"name": "test", "dependencies": {"react": "^18.2.0"}})
-        result = parse_package_json(content)
-        self.assertTrue(any(d["package"] == "react" for d in result))
-
-
-class TestParsePyprojectToml(unittest.TestCase):
-    def test_parses_project_dependencies(self):
-        content = "\n[project]\nname = \"test\"\ndependencies = [\n  \"openai>=2.21.0,<3\",\n]"
-        result = parse_pyproject_toml(content)
-        self.assertEqual(len(result), 1)
-
-
-class TestScanRepo(unittest.TestCase):
-    def test_scans_local_repo(self):
-        result = scan_repo(Path(__file__).resolve().parents[1])
-        self.assertGreater(result["dependency_count"], 0)
-
-
-if __name__ == "__main__":
-    unittest.main()