skill.md with full pipeline steps, Obsidian as default output (canvas, tags, dataview, graph colors), two-command install, 71 tests, .gitignore, deps
129 lines
5.4 KiB
Python
129 lines
5.4 KiB
Python
# generate GRAPH_REPORT.md — the human-readable audit trail
|
|
from __future__ import annotations
|
|
from datetime import date
|
|
import networkx as nx
|
|
|
|
|
|
def generate(
|
|
G: nx.Graph,
|
|
communities: dict[int, list[str]],
|
|
cohesion_scores: dict[int, float],
|
|
community_labels: dict[int, str],
|
|
god_node_list: list[dict],
|
|
surprise_list: list[dict],
|
|
detection_result: dict,
|
|
token_cost: dict,
|
|
root: str,
|
|
suggested_questions: list[dict] | None = None,
|
|
) -> str:
|
|
today = date.today().isoformat()
|
|
|
|
confidences = [d.get("confidence", "EXTRACTED") for _, _, d in G.edges(data=True)]
|
|
total = len(confidences) or 1
|
|
ext_pct = round(confidences.count("EXTRACTED") / total * 100)
|
|
inf_pct = round(confidences.count("INFERRED") / total * 100)
|
|
amb_pct = round(confidences.count("AMBIGUOUS") / total * 100)
|
|
|
|
lines = [
|
|
f"# Graph Report — {root} ({today})",
|
|
"",
|
|
"## Corpus Check",
|
|
]
|
|
if detection_result.get("warning"):
|
|
lines.append(f"- {detection_result['warning']}")
|
|
else:
|
|
lines += [
|
|
f"- {detection_result['total_files']} files · ~{detection_result['total_words']:,} words",
|
|
"- Verdict: corpus is large enough that graph structure adds value.",
|
|
]
|
|
|
|
lines += [
|
|
"",
|
|
"## Summary",
|
|
f"- {G.number_of_nodes()} nodes · {G.number_of_edges()} edges · {len(communities)} communities detected",
|
|
f"- Extraction: {ext_pct}% EXTRACTED · {inf_pct}% INFERRED · {amb_pct}% AMBIGUOUS",
|
|
f"- Token cost: {token_cost.get('input', 0):,} input · {token_cost.get('output', 0):,} output",
|
|
"",
|
|
"## God Nodes (most connected — your core abstractions)",
|
|
]
|
|
for i, node in enumerate(god_node_list, 1):
|
|
lines.append(f"{i}. `{node['label']}` — {node['edges']} edges")
|
|
|
|
lines += ["", "## Surprising Connections (you probably didn't know these)"]
|
|
if surprise_list:
|
|
for s in surprise_list:
|
|
relation = s.get("relation", "related_to")
|
|
note = s.get("note", "")
|
|
files = s.get("source_files", ["", ""])
|
|
lines += [
|
|
f"- `{s['source']}` --{relation}--> `{s['target']}` [{s['confidence']}]",
|
|
f" {files[0]} → {files[1]}" + (f" _{note}_" if note else ""),
|
|
]
|
|
else:
|
|
lines.append("- None detected — all connections are within the same source files.")
|
|
|
|
lines += ["", "## Communities"]
|
|
from .analyze import _is_file_node as _ifn
|
|
for cid, nodes in communities.items():
|
|
label = community_labels.get(cid, f"Community {cid}")
|
|
score = cohesion_scores.get(cid, 0.0)
|
|
# Filter method/function stubs from display — they're structural noise
|
|
real_nodes = [n for n in nodes if not _ifn(G, n)]
|
|
display = [G.nodes[n].get("label", n) for n in real_nodes[:8]]
|
|
suffix = f" (+{len(real_nodes)-8} more)" if len(real_nodes) > 8 else ""
|
|
lines += [
|
|
"",
|
|
f"### Community {cid} — \"{label}\"",
|
|
f"Cohesion: {score}",
|
|
f"Nodes ({len(real_nodes)}): {', '.join(display)}{suffix}",
|
|
]
|
|
|
|
ambiguous = [(u, v, d) for u, v, d in G.edges(data=True) if d.get("confidence") == "AMBIGUOUS"]
|
|
if ambiguous:
|
|
lines += ["", "## Ambiguous Edges — Review These"]
|
|
for u, v, d in ambiguous:
|
|
ul = G.nodes[u].get("label", u)
|
|
vl = G.nodes[v].get("label", v)
|
|
lines += [
|
|
f"- `{ul}` → `{vl}` [AMBIGUOUS]",
|
|
f" {d.get('source_file', '')} · relation: {d.get('relation', 'unknown')}",
|
|
]
|
|
|
|
# --- Gaps section ---
|
|
from .analyze import _is_file_node, _is_concept_node
|
|
|
|
isolated = [
|
|
n for n in G.nodes()
|
|
if G.degree(n) <= 1 and not _is_file_node(G, n) and not _is_concept_node(G, n)
|
|
]
|
|
thin_communities = {
|
|
cid: nodes for cid, nodes in communities.items() if len(nodes) < 3
|
|
}
|
|
gap_count = len(isolated) + len(thin_communities)
|
|
|
|
if gap_count > 0 or amb_pct > 20:
|
|
lines += ["", "## Knowledge Gaps"]
|
|
if isolated:
|
|
isolated_labels = [G.nodes[n].get("label", n) for n in isolated[:5]]
|
|
suffix = f" (+{len(isolated)-5} more)" if len(isolated) > 5 else ""
|
|
lines.append(f"- **{len(isolated)} isolated node(s):** {', '.join(f'`{l}`' for l in isolated_labels)}{suffix}")
|
|
lines.append(" These have ≤1 connection — possible missing edges or undocumented components.")
|
|
if thin_communities:
|
|
for cid, nodes in thin_communities.items():
|
|
label = community_labels.get(cid, f"Community {cid}")
|
|
node_labels = [G.nodes[n].get("label", n) for n in nodes]
|
|
lines.append(f"- **Thin community `{label}`** ({len(nodes)} nodes): {', '.join(f'`{l}`' for l in node_labels)}")
|
|
lines.append(" Too small to be a meaningful cluster — may be noise or needs more connections extracted.")
|
|
if amb_pct > 20:
|
|
lines.append(f"- **High ambiguity: {amb_pct}% of edges are AMBIGUOUS.** Review the Ambiguous Edges section above.")
|
|
|
|
if suggested_questions:
|
|
lines += ["", "## Suggested Questions"]
|
|
lines.append("_Questions this graph is uniquely positioned to answer:_")
|
|
lines.append("")
|
|
for q in suggested_questions:
|
|
lines.append(f"- **{q['question']}**")
|
|
lines.append(f" _{q['why']}_")
|
|
|
|
return "\n".join(lines)
|