okstra 0.130.4 → 0.131.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (365) hide show
  1. package/README.md +0 -1
  2. package/docs/architecture.md +2 -2
  3. package/docs/cli.md +1 -1
  4. package/docs/for-ai/README.md +0 -2
  5. package/docs/for-ai/skills/okstra-run.md +13 -2
  6. package/docs/for-ai/skills/okstra-setup.md +4 -1
  7. package/docs/project-structure-overview.md +5 -4
  8. package/docs/task-process/implementation-planning.md +13 -0
  9. package/docs/task-process/implementation.md +17 -2
  10. package/package.json +1 -1
  11. package/runtime/BUILD.json +2 -2
  12. package/runtime/agents/workers/report-writer-worker.md +7 -0
  13. package/runtime/bin/lib/okstra/usage.sh +4 -4
  14. package/runtime/prompts/lead/okstra-lead-contract.md +2 -2
  15. package/runtime/prompts/lead/plan-body-verification.md +26 -5
  16. package/runtime/prompts/lead/report-writer.md +6 -2
  17. package/runtime/prompts/profiles/_common-contract.md +2 -1
  18. package/runtime/prompts/profiles/_implementation-deliverable.md +6 -1
  19. package/runtime/prompts/profiles/_implementation-executor.md +2 -2
  20. package/runtime/prompts/profiles/_implementation-verifier.md +33 -10
  21. package/runtime/prompts/profiles/final-verification.md +21 -6
  22. package/runtime/prompts/profiles/implementation-planning.md +16 -4
  23. package/runtime/python/okstra_ctl/codex_dispatch.py +31 -0
  24. package/runtime/python/okstra_ctl/conformance.py +49 -11
  25. package/runtime/python/okstra_ctl/report_finalize.py +52 -1
  26. package/runtime/python/okstra_ctl/run.py +15 -3
  27. package/runtime/python/okstra_ctl/worker_prompt_contract.py +14 -6
  28. package/runtime/python/okstra_ctl/worker_prompt_policy.py +19 -1
  29. package/runtime/python/okstra_vendor/__init__.py +0 -44
  30. package/runtime/schemas/final-report-v1.0.schema.json +99 -5
  31. package/runtime/skills/okstra-run/SKILL.md +11 -4
  32. package/runtime/skills/okstra-setup/SKILL.md +3 -2
  33. package/runtime/skills/okstra-setup/references/project-config.md +16 -7
  34. package/runtime/templates/reports/final-report.template.md +15 -9
  35. package/runtime/templates/reports/i18n/en.json +1 -0
  36. package/runtime/templates/reports/i18n/ko.json +1 -0
  37. package/runtime/validators/lib/fixtures.sh +6 -0
  38. package/runtime/validators/validate-run.py +2019 -96
  39. package/src/cli-registry.mjs +0 -7
  40. package/src/commands/lifecycle/doctor.mjs +0 -9
  41. package/src/lib/skill-catalog.mjs +0 -1
  42. package/docs/for-ai/skills/okstra-graphify.md +0 -64
  43. package/runtime/python/okstra_ctl/graphify_cmd.py +0 -225
  44. package/runtime/python/okstra_vendor/graphify/.vendored-version +0 -1
  45. package/runtime/python/okstra_vendor/graphify/__init__.py +0 -28
  46. package/runtime/python/okstra_vendor/graphify/__main__.py +0 -1371
  47. package/runtime/python/okstra_vendor/graphify/analyze.py +0 -540
  48. package/runtime/python/okstra_vendor/graphify/benchmark.py +0 -129
  49. package/runtime/python/okstra_vendor/graphify/build.py +0 -107
  50. package/runtime/python/okstra_vendor/graphify/cache.py +0 -169
  51. package/runtime/python/okstra_vendor/graphify/cluster.py +0 -137
  52. package/runtime/python/okstra_vendor/graphify/detect.py +0 -510
  53. package/runtime/python/okstra_vendor/graphify/export.py +0 -1014
  54. package/runtime/python/okstra_vendor/graphify/extract.py +0 -3277
  55. package/runtime/python/okstra_vendor/graphify/hooks.py +0 -220
  56. package/runtime/python/okstra_vendor/graphify/ingest.py +0 -297
  57. package/runtime/python/okstra_vendor/graphify/manifest.py +0 -4
  58. package/runtime/python/okstra_vendor/graphify/report.py +0 -175
  59. package/runtime/python/okstra_vendor/graphify/security.py +0 -203
  60. package/runtime/python/okstra_vendor/graphify/serve.py +0 -373
  61. package/runtime/python/okstra_vendor/graphify/skill-aider.md +0 -1184
  62. package/runtime/python/okstra_vendor/graphify/skill-claw.md +0 -1184
  63. package/runtime/python/okstra_vendor/graphify/skill-codex.md +0 -1242
  64. package/runtime/python/okstra_vendor/graphify/skill-copilot.md +0 -1268
  65. package/runtime/python/okstra_vendor/graphify/skill-droid.md +0 -1239
  66. package/runtime/python/okstra_vendor/graphify/skill-kiro.md +0 -1183
  67. package/runtime/python/okstra_vendor/graphify/skill-opencode.md +0 -1238
  68. package/runtime/python/okstra_vendor/graphify/skill-trae.md +0 -1208
  69. package/runtime/python/okstra_vendor/graphify/skill-vscode.md +0 -253
  70. package/runtime/python/okstra_vendor/graphify/skill-windows.md +0 -1245
  71. package/runtime/python/okstra_vendor/graphify/skill.md +0 -1319
  72. package/runtime/python/okstra_vendor/graphify/transcribe.py +0 -182
  73. package/runtime/python/okstra_vendor/graphify/validate.py +0 -72
  74. package/runtime/python/okstra_vendor/graphify/watch.py +0 -188
  75. package/runtime/python/okstra_vendor/graphify/wiki.py +0 -214
  76. package/runtime/python/okstra_vendor/networkx/__init__.py +0 -62
  77. package/runtime/python/okstra_vendor/networkx/algorithms/__init__.py +0 -134
  78. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/__init__.py +0 -26
  79. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/clique.py +0 -259
  80. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/clustering_coefficient.py +0 -71
  81. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/connectivity.py +0 -412
  82. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/density.py +0 -396
  83. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/distance_measures.py +0 -150
  84. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/dominating_set.py +0 -149
  85. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/kcomponents.py +0 -369
  86. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/matching.py +0 -44
  87. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/maxcut.py +0 -143
  88. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/ramsey.py +0 -53
  89. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/steinertree.py +0 -265
  90. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/traveling_salesman.py +0 -1508
  91. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/treewidth.py +0 -255
  92. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/vertex_cover.py +0 -83
  93. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/__init__.py +0 -5
  94. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/connectivity.py +0 -122
  95. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/correlation.py +0 -302
  96. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/mixing.py +0 -255
  97. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/neighbor_degree.py +0 -160
  98. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/pairs.py +0 -127
  99. package/runtime/python/okstra_vendor/networkx/algorithms/asteroidal.py +0 -164
  100. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/__init__.py +0 -88
  101. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/basic.py +0 -322
  102. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/centrality.py +0 -290
  103. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/cluster.py +0 -289
  104. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/covering.py +0 -57
  105. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/edgelist.py +0 -360
  106. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/extendability.py +0 -105
  107. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/generators.py +0 -603
  108. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/link_analysis.py +0 -316
  109. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/matching.py +0 -590
  110. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/matrix.py +0 -232
  111. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/projection.py +0 -526
  112. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/redundancy.py +0 -112
  113. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/spectral.py +0 -69
  114. package/runtime/python/okstra_vendor/networkx/algorithms/boundary.py +0 -168
  115. package/runtime/python/okstra_vendor/networkx/algorithms/bridges.py +0 -205
  116. package/runtime/python/okstra_vendor/networkx/algorithms/broadcasting.py +0 -164
  117. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/__init__.py +0 -20
  118. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/betweenness.py +0 -591
  119. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/betweenness_subset.py +0 -236
  120. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/closeness.py +0 -282
  121. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_betweenness.py +0 -364
  122. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_betweenness_subset.py +0 -227
  123. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_closeness.py +0 -96
  124. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/degree_alg.py +0 -150
  125. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/dispersion.py +0 -107
  126. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/eigenvector.py +0 -357
  127. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/flow_matrix.py +0 -130
  128. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/group.py +0 -787
  129. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/harmonic.py +0 -88
  130. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/katz.py +0 -331
  131. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/laplacian.py +0 -150
  132. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/load.py +0 -200
  133. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/percolation.py +0 -128
  134. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/reaching.py +0 -209
  135. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/second_order.py +0 -141
  136. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/subgraph_alg.py +0 -361
  137. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/trophic.py +0 -181
  138. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/voterank_alg.py +0 -95
  139. package/runtime/python/okstra_vendor/networkx/algorithms/chains.py +0 -172
  140. package/runtime/python/okstra_vendor/networkx/algorithms/chordal.py +0 -443
  141. package/runtime/python/okstra_vendor/networkx/algorithms/clique.py +0 -818
  142. package/runtime/python/okstra_vendor/networkx/algorithms/cluster.py +0 -732
  143. package/runtime/python/okstra_vendor/networkx/algorithms/coloring/__init__.py +0 -4
  144. package/runtime/python/okstra_vendor/networkx/algorithms/coloring/equitable_coloring.py +0 -505
  145. package/runtime/python/okstra_vendor/networkx/algorithms/coloring/greedy_coloring.py +0 -565
  146. package/runtime/python/okstra_vendor/networkx/algorithms/communicability_alg.py +0 -163
  147. package/runtime/python/okstra_vendor/networkx/algorithms/community/__init__.py +0 -28
  148. package/runtime/python/okstra_vendor/networkx/algorithms/community/asyn_fluid.py +0 -153
  149. package/runtime/python/okstra_vendor/networkx/algorithms/community/bipartitions.py +0 -354
  150. package/runtime/python/okstra_vendor/networkx/algorithms/community/centrality.py +0 -171
  151. package/runtime/python/okstra_vendor/networkx/algorithms/community/community_utils.py +0 -30
  152. package/runtime/python/okstra_vendor/networkx/algorithms/community/divisive.py +0 -216
  153. package/runtime/python/okstra_vendor/networkx/algorithms/community/kclique.py +0 -79
  154. package/runtime/python/okstra_vendor/networkx/algorithms/community/label_propagation.py +0 -338
  155. package/runtime/python/okstra_vendor/networkx/algorithms/community/leiden.py +0 -162
  156. package/runtime/python/okstra_vendor/networkx/algorithms/community/local.py +0 -220
  157. package/runtime/python/okstra_vendor/networkx/algorithms/community/louvain.py +0 -384
  158. package/runtime/python/okstra_vendor/networkx/algorithms/community/lukes.py +0 -227
  159. package/runtime/python/okstra_vendor/networkx/algorithms/community/modularity_max.py +0 -452
  160. package/runtime/python/okstra_vendor/networkx/algorithms/community/quality.py +0 -347
  161. package/runtime/python/okstra_vendor/networkx/algorithms/components/__init__.py +0 -6
  162. package/runtime/python/okstra_vendor/networkx/algorithms/components/attracting.py +0 -115
  163. package/runtime/python/okstra_vendor/networkx/algorithms/components/biconnected.py +0 -394
  164. package/runtime/python/okstra_vendor/networkx/algorithms/components/connected.py +0 -282
  165. package/runtime/python/okstra_vendor/networkx/algorithms/components/semiconnected.py +0 -71
  166. package/runtime/python/okstra_vendor/networkx/algorithms/components/strongly_connected.py +0 -359
  167. package/runtime/python/okstra_vendor/networkx/algorithms/components/weakly_connected.py +0 -196
  168. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/__init__.py +0 -11
  169. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/connectivity.py +0 -811
  170. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/cuts.py +0 -616
  171. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/disjoint_paths.py +0 -408
  172. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/edge_augmentation.py +0 -1270
  173. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/edge_kcomponents.py +0 -592
  174. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/kcomponents.py +0 -220
  175. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/kcutsets.py +0 -235
  176. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/stoerwagner.py +0 -152
  177. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/utils.py +0 -88
  178. package/runtime/python/okstra_vendor/networkx/algorithms/core.py +0 -588
  179. package/runtime/python/okstra_vendor/networkx/algorithms/covering.py +0 -142
  180. package/runtime/python/okstra_vendor/networkx/algorithms/cuts.py +0 -416
  181. package/runtime/python/okstra_vendor/networkx/algorithms/cycles.py +0 -1234
  182. package/runtime/python/okstra_vendor/networkx/algorithms/d_separation.py +0 -677
  183. package/runtime/python/okstra_vendor/networkx/algorithms/dag.py +0 -1392
  184. package/runtime/python/okstra_vendor/networkx/algorithms/distance_measures.py +0 -1095
  185. package/runtime/python/okstra_vendor/networkx/algorithms/distance_regular.py +0 -272
  186. package/runtime/python/okstra_vendor/networkx/algorithms/dominance.py +0 -142
  187. package/runtime/python/okstra_vendor/networkx/algorithms/dominating.py +0 -268
  188. package/runtime/python/okstra_vendor/networkx/algorithms/efficiency_measures.py +0 -167
  189. package/runtime/python/okstra_vendor/networkx/algorithms/euler.py +0 -470
  190. package/runtime/python/okstra_vendor/networkx/algorithms/flow/__init__.py +0 -11
  191. package/runtime/python/okstra_vendor/networkx/algorithms/flow/boykovkolmogorov.py +0 -370
  192. package/runtime/python/okstra_vendor/networkx/algorithms/flow/capacityscaling.py +0 -407
  193. package/runtime/python/okstra_vendor/networkx/algorithms/flow/dinitz_alg.py +0 -238
  194. package/runtime/python/okstra_vendor/networkx/algorithms/flow/edmondskarp.py +0 -241
  195. package/runtime/python/okstra_vendor/networkx/algorithms/flow/gomory_hu.py +0 -178
  196. package/runtime/python/okstra_vendor/networkx/algorithms/flow/maxflow.py +0 -611
  197. package/runtime/python/okstra_vendor/networkx/algorithms/flow/mincost.py +0 -356
  198. package/runtime/python/okstra_vendor/networkx/algorithms/flow/networksimplex.py +0 -662
  199. package/runtime/python/okstra_vendor/networkx/algorithms/flow/preflowpush.py +0 -425
  200. package/runtime/python/okstra_vendor/networkx/algorithms/flow/shortestaugmentingpath.py +0 -300
  201. package/runtime/python/okstra_vendor/networkx/algorithms/flow/utils.py +0 -194
  202. package/runtime/python/okstra_vendor/networkx/algorithms/graph_hashing.py +0 -435
  203. package/runtime/python/okstra_vendor/networkx/algorithms/graphical.py +0 -483
  204. package/runtime/python/okstra_vendor/networkx/algorithms/hierarchy.py +0 -57
  205. package/runtime/python/okstra_vendor/networkx/algorithms/hybrid.py +0 -196
  206. package/runtime/python/okstra_vendor/networkx/algorithms/isolate.py +0 -107
  207. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/__init__.py +0 -7
  208. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/ismags.py +0 -1306
  209. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/isomorph.py +0 -336
  210. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/isomorphvf2.py +0 -1262
  211. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/matchhelpers.py +0 -352
  212. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/temporalisomorphvf2.py +0 -308
  213. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tree_isomorphism.py +0 -264
  214. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/vf2pp.py +0 -1102
  215. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/vf2userfunc.py +0 -192
  216. package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/__init__.py +0 -2
  217. package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/hits_alg.py +0 -337
  218. package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/pagerank_alg.py +0 -498
  219. package/runtime/python/okstra_vendor/networkx/algorithms/link_prediction.py +0 -687
  220. package/runtime/python/okstra_vendor/networkx/algorithms/lowest_common_ancestors.py +0 -280
  221. package/runtime/python/okstra_vendor/networkx/algorithms/matching.py +0 -1148
  222. package/runtime/python/okstra_vendor/networkx/algorithms/minors/__init__.py +0 -27
  223. package/runtime/python/okstra_vendor/networkx/algorithms/minors/contraction.py +0 -738
  224. package/runtime/python/okstra_vendor/networkx/algorithms/mis.py +0 -78
  225. package/runtime/python/okstra_vendor/networkx/algorithms/moral.py +0 -59
  226. package/runtime/python/okstra_vendor/networkx/algorithms/node_classification.py +0 -219
  227. package/runtime/python/okstra_vendor/networkx/algorithms/non_randomness.py +0 -155
  228. package/runtime/python/okstra_vendor/networkx/algorithms/operators/__init__.py +0 -4
  229. package/runtime/python/okstra_vendor/networkx/algorithms/operators/all.py +0 -324
  230. package/runtime/python/okstra_vendor/networkx/algorithms/operators/binary.py +0 -468
  231. package/runtime/python/okstra_vendor/networkx/algorithms/operators/product.py +0 -633
  232. package/runtime/python/okstra_vendor/networkx/algorithms/operators/unary.py +0 -77
  233. package/runtime/python/okstra_vendor/networkx/algorithms/perfect_graph.py +0 -73
  234. package/runtime/python/okstra_vendor/networkx/algorithms/planar_drawing.py +0 -464
  235. package/runtime/python/okstra_vendor/networkx/algorithms/planarity.py +0 -1463
  236. package/runtime/python/okstra_vendor/networkx/algorithms/polynomials.py +0 -306
  237. package/runtime/python/okstra_vendor/networkx/algorithms/reciprocity.py +0 -98
  238. package/runtime/python/okstra_vendor/networkx/algorithms/regular.py +0 -167
  239. package/runtime/python/okstra_vendor/networkx/algorithms/richclub.py +0 -138
  240. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/__init__.py +0 -5
  241. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/astar.py +0 -239
  242. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/dense.py +0 -264
  243. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/generic.py +0 -716
  244. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/unweighted.py +0 -625
  245. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/weighted.py +0 -2542
  246. package/runtime/python/okstra_vendor/networkx/algorithms/similarity.py +0 -2107
  247. package/runtime/python/okstra_vendor/networkx/algorithms/simple_paths.py +0 -966
  248. package/runtime/python/okstra_vendor/networkx/algorithms/smallworld.py +0 -404
  249. package/runtime/python/okstra_vendor/networkx/algorithms/smetric.py +0 -30
  250. package/runtime/python/okstra_vendor/networkx/algorithms/sparsifiers.py +0 -296
  251. package/runtime/python/okstra_vendor/networkx/algorithms/structuralholes.py +0 -374
  252. package/runtime/python/okstra_vendor/networkx/algorithms/summarization.py +0 -564
  253. package/runtime/python/okstra_vendor/networkx/algorithms/swap.py +0 -406
  254. package/runtime/python/okstra_vendor/networkx/algorithms/threshold.py +0 -981
  255. package/runtime/python/okstra_vendor/networkx/algorithms/time_dependent.py +0 -142
  256. package/runtime/python/okstra_vendor/networkx/algorithms/tournament.py +0 -406
  257. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/__init__.py +0 -5
  258. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/beamsearch.py +0 -90
  259. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/breadth_first_search.py +0 -576
  260. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/depth_first_search.py +0 -529
  261. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/edgebfs.py +0 -185
  262. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/edgedfs.py +0 -182
  263. package/runtime/python/okstra_vendor/networkx/algorithms/tree/__init__.py +0 -7
  264. package/runtime/python/okstra_vendor/networkx/algorithms/tree/branchings.py +0 -1042
  265. package/runtime/python/okstra_vendor/networkx/algorithms/tree/coding.py +0 -413
  266. package/runtime/python/okstra_vendor/networkx/algorithms/tree/decomposition.py +0 -88
  267. package/runtime/python/okstra_vendor/networkx/algorithms/tree/distance_measures.py +0 -219
  268. package/runtime/python/okstra_vendor/networkx/algorithms/tree/mst.py +0 -1281
  269. package/runtime/python/okstra_vendor/networkx/algorithms/tree/operations.py +0 -106
  270. package/runtime/python/okstra_vendor/networkx/algorithms/tree/recognition.py +0 -273
  271. package/runtime/python/okstra_vendor/networkx/algorithms/triads.py +0 -500
  272. package/runtime/python/okstra_vendor/networkx/algorithms/vitality.py +0 -76
  273. package/runtime/python/okstra_vendor/networkx/algorithms/voronoi.py +0 -86
  274. package/runtime/python/okstra_vendor/networkx/algorithms/walks.py +0 -77
  275. package/runtime/python/okstra_vendor/networkx/algorithms/wiener.py +0 -278
  276. package/runtime/python/okstra_vendor/networkx/classes/__init__.py +0 -13
  277. package/runtime/python/okstra_vendor/networkx/classes/coreviews.py +0 -435
  278. package/runtime/python/okstra_vendor/networkx/classes/digraph.py +0 -1363
  279. package/runtime/python/okstra_vendor/networkx/classes/filters.py +0 -95
  280. package/runtime/python/okstra_vendor/networkx/classes/function.py +0 -1549
  281. package/runtime/python/okstra_vendor/networkx/classes/graph.py +0 -2082
  282. package/runtime/python/okstra_vendor/networkx/classes/graphviews.py +0 -269
  283. package/runtime/python/okstra_vendor/networkx/classes/multidigraph.py +0 -977
  284. package/runtime/python/okstra_vendor/networkx/classes/multigraph.py +0 -1294
  285. package/runtime/python/okstra_vendor/networkx/classes/reportviews.py +0 -1447
  286. package/runtime/python/okstra_vendor/networkx/convert.py +0 -502
  287. package/runtime/python/okstra_vendor/networkx/convert_matrix.py +0 -1314
  288. package/runtime/python/okstra_vendor/networkx/drawing/__init__.py +0 -7
  289. package/runtime/python/okstra_vendor/networkx/drawing/layout.py +0 -2036
  290. package/runtime/python/okstra_vendor/networkx/drawing/nx_agraph.py +0 -470
  291. package/runtime/python/okstra_vendor/networkx/drawing/nx_latex.py +0 -570
  292. package/runtime/python/okstra_vendor/networkx/drawing/nx_pydot.py +0 -361
  293. package/runtime/python/okstra_vendor/networkx/drawing/nx_pylab.py +0 -2978
  294. package/runtime/python/okstra_vendor/networkx/exception.py +0 -131
  295. package/runtime/python/okstra_vendor/networkx/generators/__init__.py +0 -34
  296. package/runtime/python/okstra_vendor/networkx/generators/atlas.dat.gz +0 -0
  297. package/runtime/python/okstra_vendor/networkx/generators/atlas.py +0 -227
  298. package/runtime/python/okstra_vendor/networkx/generators/classic.py +0 -1091
  299. package/runtime/python/okstra_vendor/networkx/generators/cographs.py +0 -68
  300. package/runtime/python/okstra_vendor/networkx/generators/community.py +0 -1070
  301. package/runtime/python/okstra_vendor/networkx/generators/degree_seq.py +0 -886
  302. package/runtime/python/okstra_vendor/networkx/generators/directed.py +0 -572
  303. package/runtime/python/okstra_vendor/networkx/generators/duplication.py +0 -174
  304. package/runtime/python/okstra_vendor/networkx/generators/ego.py +0 -66
  305. package/runtime/python/okstra_vendor/networkx/generators/expanders.py +0 -499
  306. package/runtime/python/okstra_vendor/networkx/generators/geometric.py +0 -1037
  307. package/runtime/python/okstra_vendor/networkx/generators/harary_graph.py +0 -163
  308. package/runtime/python/okstra_vendor/networkx/generators/internet_as_graphs.py +0 -443
  309. package/runtime/python/okstra_vendor/networkx/generators/intersection.py +0 -125
  310. package/runtime/python/okstra_vendor/networkx/generators/interval_graph.py +0 -70
  311. package/runtime/python/okstra_vendor/networkx/generators/joint_degree_seq.py +0 -664
  312. package/runtime/python/okstra_vendor/networkx/generators/lattice.py +0 -405
  313. package/runtime/python/okstra_vendor/networkx/generators/line.py +0 -501
  314. package/runtime/python/okstra_vendor/networkx/generators/mycielski.py +0 -110
  315. package/runtime/python/okstra_vendor/networkx/generators/nonisomorphic_trees.py +0 -259
  316. package/runtime/python/okstra_vendor/networkx/generators/random_clustered.py +0 -117
  317. package/runtime/python/okstra_vendor/networkx/generators/random_graphs.py +0 -1416
  318. package/runtime/python/okstra_vendor/networkx/generators/small.py +0 -1070
  319. package/runtime/python/okstra_vendor/networkx/generators/social.py +0 -554
  320. package/runtime/python/okstra_vendor/networkx/generators/spectral_graph_forge.py +0 -120
  321. package/runtime/python/okstra_vendor/networkx/generators/stochastic.py +0 -54
  322. package/runtime/python/okstra_vendor/networkx/generators/sudoku.py +0 -131
  323. package/runtime/python/okstra_vendor/networkx/generators/time_series.py +0 -74
  324. package/runtime/python/okstra_vendor/networkx/generators/trees.py +0 -1070
  325. package/runtime/python/okstra_vendor/networkx/generators/triads.py +0 -94
  326. package/runtime/python/okstra_vendor/networkx/lazy_imports.py +0 -188
  327. package/runtime/python/okstra_vendor/networkx/linalg/__init__.py +0 -13
  328. package/runtime/python/okstra_vendor/networkx/linalg/algebraicconnectivity.py +0 -650
  329. package/runtime/python/okstra_vendor/networkx/linalg/attrmatrix.py +0 -466
  330. package/runtime/python/okstra_vendor/networkx/linalg/bethehessianmatrix.py +0 -77
  331. package/runtime/python/okstra_vendor/networkx/linalg/graphmatrix.py +0 -168
  332. package/runtime/python/okstra_vendor/networkx/linalg/laplacianmatrix.py +0 -512
  333. package/runtime/python/okstra_vendor/networkx/linalg/modularitymatrix.py +0 -166
  334. package/runtime/python/okstra_vendor/networkx/linalg/spectrum.py +0 -186
  335. package/runtime/python/okstra_vendor/networkx/readwrite/__init__.py +0 -17
  336. package/runtime/python/okstra_vendor/networkx/readwrite/adjlist.py +0 -330
  337. package/runtime/python/okstra_vendor/networkx/readwrite/edgelist.py +0 -489
  338. package/runtime/python/okstra_vendor/networkx/readwrite/gexf.py +0 -1084
  339. package/runtime/python/okstra_vendor/networkx/readwrite/gml.py +0 -879
  340. package/runtime/python/okstra_vendor/networkx/readwrite/graph6.py +0 -427
  341. package/runtime/python/okstra_vendor/networkx/readwrite/graphml.py +0 -1053
  342. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/__init__.py +0 -19
  343. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/adjacency.py +0 -156
  344. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/cytoscape.py +0 -190
  345. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/node_link.py +0 -261
  346. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tree.py +0 -137
  347. package/runtime/python/okstra_vendor/networkx/readwrite/leda.py +0 -108
  348. package/runtime/python/okstra_vendor/networkx/readwrite/multiline_adjlist.py +0 -393
  349. package/runtime/python/okstra_vendor/networkx/readwrite/p2g.py +0 -113
  350. package/runtime/python/okstra_vendor/networkx/readwrite/pajek.py +0 -286
  351. package/runtime/python/okstra_vendor/networkx/readwrite/sparse6.py +0 -379
  352. package/runtime/python/okstra_vendor/networkx/readwrite/text.py +0 -851
  353. package/runtime/python/okstra_vendor/networkx/relabel.py +0 -285
  354. package/runtime/python/okstra_vendor/networkx/utils/__init__.py +0 -8
  355. package/runtime/python/okstra_vendor/networkx/utils/backends.py +0 -2171
  356. package/runtime/python/okstra_vendor/networkx/utils/configs.py +0 -396
  357. package/runtime/python/okstra_vendor/networkx/utils/decorators.py +0 -1233
  358. package/runtime/python/okstra_vendor/networkx/utils/heaps.py +0 -338
  359. package/runtime/python/okstra_vendor/networkx/utils/mapped_queue.py +0 -297
  360. package/runtime/python/okstra_vendor/networkx/utils/misc.py +0 -703
  361. package/runtime/python/okstra_vendor/networkx/utils/random_sequence.py +0 -198
  362. package/runtime/python/okstra_vendor/networkx/utils/rcm.py +0 -159
  363. package/runtime/python/okstra_vendor/networkx/utils/union_find.py +0 -106
  364. package/runtime/skills/okstra-graphify/SKILL.md +0 -169
  365. package/src/commands/graphify.mjs +0 -32
@@ -1,1319 +0,0 @@
1
- ---
2
- name: graphify
3
- description: "any input (code, docs, papers, images) - knowledge graph - clustered communities - HTML + JSON + audit report"
4
- trigger: /graphify
5
- ---
6
-
7
- # /graphify
8
-
9
- Turn any folder of files into a navigable knowledge graph with community detection, an honest audit trail, and three outputs: interactive HTML, GraphRAG-ready JSON, and a plain-language GRAPH_REPORT.md.
10
-
11
- ## Usage
12
-
13
- ```
14
- /graphify # full pipeline on current directory → Obsidian vault
15
- /graphify <path> # full pipeline on specific path
16
- /graphify <path> --mode deep # thorough extraction, richer INFERRED edges
17
- /graphify <path> --update # incremental - re-extract only new/changed files
18
- /graphify <path> --directed # build directed graph (preserves edge direction: source→target)
19
- /graphify <path> --whisper-model medium # use a larger Whisper model for better transcription accuracy
20
- /graphify <path> --cluster-only # rerun clustering on existing graph
21
- /graphify <path> --no-viz # skip visualization, just report + JSON
22
- /graphify <path> --html # (HTML is generated by default - this flag is a no-op)
23
- /graphify <path> --svg # also export graph.svg (embeds in Notion, GitHub)
24
- /graphify <path> --graphml # export graph.graphml (Gephi, yEd)
25
- /graphify <path> --neo4j # generate graphify-out/cypher.txt for Neo4j
26
- /graphify <path> --neo4j-push bolt://localhost:7687 # push directly to Neo4j
27
- /graphify <path> --mcp # start MCP stdio server for agent access
28
- /graphify <path> --watch # watch folder, auto-rebuild on code changes (no LLM needed)
29
- /graphify <path> --wiki # build agent-crawlable wiki (index.md + one article per community)
30
- /graphify <path> --obsidian --obsidian-dir ~/vaults/my-project # write vault to custom path (e.g. existing vault)
31
- /graphify add <url> # fetch URL, save to ./raw, update graph
32
- /graphify add <url> --author "Name" # tag who wrote it
33
- /graphify add <url> --contributor "Name" # tag who added it to the corpus
34
- /graphify query "<question>" # BFS traversal - broad context
35
- /graphify query "<question>" --dfs # DFS - trace a specific path
36
- /graphify query "<question>" --budget 1500 # cap answer at N tokens
37
- /graphify path "AuthModule" "Database" # shortest path between two concepts
38
- /graphify explain "SwinTransformer" # plain-language explanation of a node
39
- ```
40
-
41
- ## What graphify is for
42
-
43
- graphify is built around Andrej Karpathy's /raw folder workflow: drop anything into a folder - papers, tweets, screenshots, code, notes - and get a structured knowledge graph that shows you what you didn't know was connected.
44
-
45
- Three things it does that Claude alone cannot:
46
- 1. **Persistent graph** - relationships are stored in `graphify-out/graph.json` and survive across sessions. Ask questions weeks later without re-reading everything.
47
- 2. **Honest audit trail** - every edge is tagged EXTRACTED, INFERRED, or AMBIGUOUS. You know what was found vs invented.
48
- 3. **Cross-document surprise** - community detection finds connections between concepts in different files that you would never think to ask about directly.
49
-
50
- Use it for:
51
- - A codebase you're new to (understand architecture before touching anything)
52
- - A reading list (papers + tweets + notes → one navigable graph)
53
- - A research corpus (citation graph + concept graph in one)
54
- - Your personal /raw folder (drop everything in, let it grow, query it)
55
-
56
- ## What You Must Do When Invoked
57
-
58
- If no path was given, use `.` (current directory). Do not ask the user for a path.
59
-
60
- Follow these steps in order. Do not skip steps.
61
-
62
- ### Step 1 - Ensure graphify is installed
63
-
64
- ```bash
65
- # Detect the correct Python interpreter (handles pipx, venv, system installs)
66
- GRAPHIFY_BIN=$(which graphify 2>/dev/null)
67
- if [ -n "$GRAPHIFY_BIN" ]; then
68
- PYTHON=$(head -1 "$GRAPHIFY_BIN" | tr -d '#!')
69
- case "$PYTHON" in
70
- *[!a-zA-Z0-9/_.-]*) PYTHON="python3" ;;
71
- esac
72
- else
73
- PYTHON="python3"
74
- fi
75
- "$PYTHON" -c "import graphify" 2>/dev/null || "$PYTHON" -m pip install graphifyy -q 2>/dev/null || "$PYTHON" -m pip install graphifyy -q --break-system-packages 2>&1 | tail -3
76
- # Write interpreter path for all subsequent steps (persists across invocations)
77
- mkdir -p graphify-out
78
- "$PYTHON" -c "import sys; open('graphify-out/.graphify_python', 'w').write(sys.executable)"
79
- ```
80
-
81
- If the import succeeds, print nothing and move straight to Step 2.
82
-
83
- **In every subsequent bash block, replace `python3` with `$(cat graphify-out/.graphify_python)` to use the correct interpreter.**
84
-
85
- ### Step 2 - Detect files
86
-
87
- ```bash
88
- $(cat graphify-out/.graphify_python) -c "
89
- import json
90
- from graphify.detect import detect
91
- from pathlib import Path
92
- result = detect(Path('INPUT_PATH'))
93
- print(json.dumps(result))
94
- " > graphify-out/.graphify_detect.json
95
- ```
96
-
97
- Replace INPUT_PATH with the actual path the user provided. Do NOT cat or print the JSON - read it silently and present a clean summary instead:
98
-
99
- ```
100
- Corpus: X files · ~Y words
101
- code: N files (.py .ts .go ...)
102
- docs: N files (.md .txt ...)
103
- papers: N files (.pdf ...)
104
- images: N files
105
- video: N files (.mp4 .mp3 ...)
106
- ```
107
-
108
- Omit any category with 0 files from the summary.
109
-
110
- Then act on it:
111
- - If `total_files` is 0: stop with "No supported files found in [path]."
112
- - If `skipped_sensitive` is non-empty: mention file count skipped, not the file names.
113
- - If `total_words` > 2,000,000 OR `total_files` > 200: show the warning and the top 5 subdirectories by file count, then ask which subfolder to run on. Wait for the user's answer before proceeding.
114
- - Otherwise: proceed directly to Step 2.5 if video files were detected, or Step 3 if not.
115
-
116
- ### Step 2.5 - Transcribe video / audio files (only if video files detected)
117
-
118
- Skip this step entirely if `detect` returned zero `video` files.
119
-
120
- Video and audio files cannot be read directly. Transcribe them to text first, then treat the transcripts as doc files in Step 3.
121
-
122
- **Strategy:** Read the god nodes from `graphify-out/.graphify_detect.json` (or the analysis file if it exists from a previous run). You are already a language model — write a one-sentence domain hint yourself from those labels. Then pass it to Whisper as the initial prompt. No separate API call needed.
123
-
124
- **However**, if the corpus has *only* video files and no other docs/code, use the generic fallback prompt: `"Use proper punctuation and paragraph breaks."`
125
-
126
- **Step 1 - Write the Whisper prompt yourself.**
127
-
128
- Read the top god node labels from detect output or analysis, then compose a short domain hint sentence, for example:
129
-
130
- - Labels: `transformer, attention, encoder, decoder` → `"Machine learning research on transformer architectures and attention mechanisms. Use proper punctuation and paragraph breaks."`
131
- - Labels: `kubernetes, deployment, pod, helm` → `"DevOps discussion about Kubernetes deployments and Helm charts. Use proper punctuation and paragraph breaks."`
132
-
133
- Set it as `WHISPER_PROMPT` to use in the next command.
134
-
135
- **Step 2 - Transcribe:**
136
-
137
- ```bash
138
- GRAPHIFY_WHISPER_MODEL=base # or whatever --whisper-model the user passed
139
- $(cat graphify-out/.graphify_python) -c "
140
- import json, os
141
- from pathlib import Path
142
- from graphify.transcribe import transcribe_all
143
-
144
- detect = json.loads(Path('graphify-out/.graphify_detect.json').read_text())
145
- video_files = detect.get('files', {}).get('video', [])
146
- prompt = os.environ.get('GRAPHIFY_WHISPER_PROMPT', 'Use proper punctuation and paragraph breaks.')
147
-
148
- transcript_paths = transcribe_all(video_files, initial_prompt=prompt)
149
- print(json.dumps(transcript_paths))
150
- " > graphify-out/.graphify_transcripts.json
151
- ```
152
-
153
- After transcription:
154
- - Read the transcript paths from `graphify-out/.graphify_transcripts.json`
155
- - Add them to the docs list before dispatching semantic subagents in Step 3B
156
- - Print how many transcripts were created: `Transcribed N video file(s) -> treating as docs`
157
- - If transcription fails for a file, print a warning and continue with the rest
158
-
159
- **Whisper model:** Default is `base`. If the user passed `--whisper-model <name>`, set `GRAPHIFY_WHISPER_MODEL=<name>` in the environment before running the command above.
160
-
161
- ### Step 3 - Extract entities and relationships
162
-
163
- **Before starting:** note whether `--mode deep` was given. You must pass `DEEP_MODE=true` to every subagent in Step B2 if it was. Track this from the original invocation - do not lose it.
164
-
165
- This step has two parts: **structural extraction** (deterministic, free) and **semantic extraction** (Claude, costs tokens).
166
-
167
- **Run Part A (AST) and Part B (semantic) in parallel. Dispatch all semantic subagents AND start AST extraction in the same message. Both can run simultaneously since they operate on different file types. Merge results in Part C as before.**
168
-
169
- Note: Parallelizing AST + semantic saves 5-15s on large corpora. AST is deterministic and fast; start it while subagents are processing docs/papers.
170
-
171
- #### Part A - Structural extraction for code files
172
-
173
- For any code files detected, run AST extraction in parallel with Part B subagents:
174
-
175
- ```bash
176
- $(cat graphify-out/.graphify_python) -c "
177
- import sys, json
178
- from graphify.extract import collect_files, extract
179
- from pathlib import Path
180
- import json
181
-
182
- code_files = []
183
- detect = json.loads(Path('graphify-out/.graphify_detect.json').read_text())
184
- for f in detect.get('files', {}).get('code', []):
185
- code_files.extend(collect_files(Path(f)) if Path(f).is_dir() else [Path(f)])
186
-
187
- if code_files:
188
- result = extract(code_files, cache_root=Path('.'))
189
- Path('graphify-out/.graphify_ast.json').write_text(json.dumps(result, indent=2))
190
- print(f'AST: {len(result[\"nodes\"])} nodes, {len(result[\"edges\"])} edges')
191
- else:
192
- Path('graphify-out/.graphify_ast.json').write_text(json.dumps({'nodes':[],'edges':[],'input_tokens':0,'output_tokens':0}))
193
- print('No code files - skipping AST extraction')
194
- "
195
- ```
196
-
197
- #### Part B - Semantic extraction (parallel subagents)
198
-
199
- **Fast path:** If detection found zero docs, papers, and images (code-only corpus), skip Part B entirely and go straight to Part C. AST handles code - there is nothing for semantic subagents to do.
200
-
201
- **MANDATORY: You MUST use the Agent tool here. Reading files yourself one-by-one is forbidden - it is 5-10x slower. If you do not use the Agent tool you are doing this wrong.**
202
-
203
- Before dispatching subagents, print a timing estimate:
204
- - Load `total_words` and file counts from `graphify-out/.graphify_detect.json`
205
- - Estimate agents needed: `ceil(uncached_non_code_files / 22)` (chunk size is 20-25)
206
- - Estimate time: ~45s per agent batch (they run in parallel, so total ≈ 45s × ceil(agents/parallel_limit))
207
- - Print: "Semantic extraction: ~N files → X agents, estimated ~Ys"
208
-
209
- **Step B0 - Check extraction cache first**
210
-
211
- Before dispatching any subagents, check which files already have cached extraction results:
212
-
213
- ```bash
214
- $(cat graphify-out/.graphify_python) -c "
215
- import json
216
- from graphify.cache import check_semantic_cache
217
- from pathlib import Path
218
-
219
- detect = json.loads(Path('graphify-out/.graphify_detect.json').read_text())
220
- all_files = [f for files in detect['files'].values() for f in files]
221
-
222
- cached_nodes, cached_edges, cached_hyperedges, uncached = check_semantic_cache(all_files)
223
-
224
- if cached_nodes or cached_edges or cached_hyperedges:
225
- Path('graphify-out/.graphify_cached.json').write_text(json.dumps({'nodes': cached_nodes, 'edges': cached_edges, 'hyperedges': cached_hyperedges}))
226
- Path('graphify-out/.graphify_uncached.txt').write_text('\n'.join(uncached))
227
- print(f'Cache: {len(all_files)-len(uncached)} files hit, {len(uncached)} files need extraction')
228
- "
229
- ```
230
-
231
- Only dispatch subagents for files listed in `graphify-out/.graphify_uncached.txt`. If all files are cached, skip to Part C directly.
232
-
233
- **Step B1 - Split into chunks**
234
-
235
- Load files from `graphify-out/.graphify_uncached.txt`. Split into chunks of 20-25 files each. Each image gets its own chunk (vision needs separate context). When splitting, group files from the same directory together so related artifacts land in the same chunk and cross-file relationships are more likely to be extracted.
236
-
237
- **Step B2 - Dispatch ALL subagents in a single message**
238
-
239
- Call the Agent tool multiple times IN THE SAME RESPONSE - one call per chunk. This is the only way they run in parallel. If you make one Agent call, wait, then make another, you are doing it sequentially and defeating the purpose.
240
-
241
- **IMPORTANT - subagent type:** Always use `subagent_type="general-purpose"`. Do NOT use `Explore` - it is read-only and cannot write chunk files to disk, which silently drops extraction results. General-purpose has Write and Bash access which the subagent needs.
242
-
243
- Concrete example for 3 chunks:
244
- ```
245
- [Agent tool call 1: files 1-15, subagent_type="general-purpose"]
246
- [Agent tool call 2: files 16-30, subagent_type="general-purpose"]
247
- [Agent tool call 3: files 31-45, subagent_type="general-purpose"]
248
- ```
249
- All three in one message. Not three separate messages.
250
-
251
- Each subagent receives this exact prompt (substitute FILE_LIST, CHUNK_NUM, TOTAL_CHUNKS, and DEEP_MODE):
252
-
253
- ```
254
- You are a graphify extraction subagent. Read the files listed and extract a knowledge graph fragment.
255
- Output ONLY valid JSON matching the schema below - no explanation, no markdown fences, no preamble.
256
-
257
- Files (chunk CHUNK_NUM of TOTAL_CHUNKS):
258
- FILE_LIST
259
-
260
- Rules:
261
- - EXTRACTED: relationship explicit in source (import, call, citation, "see §3.2")
262
- - INFERRED: reasonable inference (shared data structure, implied dependency)
263
- - AMBIGUOUS: uncertain - flag for review, do not omit
264
-
265
- Code files: focus on semantic edges AST cannot find (call relationships, shared data, arch patterns).
266
- Do not re-extract imports - AST already has those.
267
- Doc/paper files: extract named concepts, entities, citations. Also extract rationale — sections that explain WHY a decision was made, trade-offs chosen, or design intent. These become nodes with `rationale_for` edges pointing to the concept they explain.
268
- Image files: use vision to understand what the image IS - do not just OCR.
269
- UI screenshot: layout patterns, design decisions, key elements, purpose.
270
- Chart: metric, trend/insight, data source.
271
- Tweet/post: claim as node, author, concepts mentioned.
272
- Diagram: components and connections.
273
- Research figure: what it demonstrates, method, result.
274
- Handwritten/whiteboard: ideas and arrows, mark uncertain readings AMBIGUOUS.
275
-
276
- DEEP_MODE (if --mode deep was given): be aggressive with INFERRED edges - indirect deps,
277
- shared assumptions, latent couplings. Mark uncertain ones AMBIGUOUS instead of omitting.
278
-
279
- Semantic similarity: if two concepts in this chunk solve the same problem or represent the same idea without any structural link (no import, no call, no citation), add a `semantically_similar_to` edge marked INFERRED with a confidence_score reflecting how similar they are (0.6-0.95). Examples:
280
- - Two functions that both validate user input but never call each other
281
- - A class in code and a concept in a paper that describe the same algorithm
282
- - Two error types that handle the same failure mode differently
283
- Only add these when the similarity is genuinely non-obvious and cross-cutting. Do not add them for trivially similar things.
284
-
285
- Hyperedges: if 3 or more nodes clearly participate together in a shared concept, flow, or pattern that is not captured by pairwise edges alone, add a hyperedge to a top-level `hyperedges` array. Examples:
286
- - All classes that implement a common protocol or interface
287
- - All functions in an authentication flow (even if they don't all call each other)
288
- - All concepts from a paper section that form one coherent idea
289
- Use sparingly — only when the group relationship adds information beyond the pairwise edges. Maximum 3 hyperedges per chunk.
290
-
291
- If a file has YAML frontmatter (--- ... ---), copy source_url, captured_at, author,
292
- contributor onto every node from that file.
293
-
294
- confidence_score is REQUIRED on every edge - never omit it, never use 0.5 as a default:
295
- - EXTRACTED edges: confidence_score = 1.0 always
296
- - INFERRED edges: reason about each edge individually.
297
- Direct structural evidence (shared data structure, clear dependency): 0.8-0.9.
298
- Reasonable inference with some uncertainty: 0.6-0.7.
299
- Weak or speculative: 0.4-0.5. Most edges should be 0.6-0.9, not 0.5.
300
- - AMBIGUOUS edges: 0.1-0.3
301
-
302
- Node ID format: lowercase, only `[a-z0-9_]`, no dots or slashes. Format: `{stem}_{entity}` where stem is the filename without extension and entity is the symbol name, both normalized (lowercase, non-alphanumeric chars replaced with `_`). Example: `src/auth/session.py` + `ValidateToken` → `session_validatetoken`. This must match the ID the AST extractor generates so cross-references between code and semantic nodes connect correctly.
303
-
304
- Output exactly this JSON (no other text):
305
- {"nodes":[{"id":"session_validatetoken","label":"Human Readable Name","file_type":"code|document|paper|image","source_file":"relative/path","source_location":null,"source_url":null,"captured_at":null,"author":null,"contributor":null}],"edges":[{"source":"node_id","target":"node_id","relation":"calls|implements|references|cites|conceptually_related_to|shares_data_with|semantically_similar_to|rationale_for","confidence":"EXTRACTED|INFERRED|AMBIGUOUS","confidence_score":1.0,"source_file":"relative/path","source_location":null,"weight":1.0}],"hyperedges":[{"id":"snake_case_id","label":"Human Readable Label","nodes":["node_id1","node_id2","node_id3"],"relation":"participate_in|implement|form","confidence":"EXTRACTED|INFERRED","confidence_score":0.75,"source_file":"relative/path"}],"input_tokens":0,"output_tokens":0}
306
- ```
307
-
308
- **Step B3 - Collect, cache, and merge**
309
-
310
- Wait for all subagents. For each result:
311
- - Check that `graphify-out/.graphify_chunk_NN.json` exists on disk — this is the success signal
312
- - If the file exists and contains valid JSON with `nodes` and `edges`, include it and save to cache
313
- - If the file is missing, the subagent was likely dispatched as read-only (Explore type) — print a warning: "chunk N missing from disk — subagent may have been read-only. Re-run with general-purpose agent." Do not silently skip.
314
- - If a subagent failed or returned invalid JSON, print a warning and skip that chunk - do not abort
315
-
316
- If more than half the chunks failed or are missing, stop and tell the user to re-run and ensure `subagent_type="general-purpose"` is used.
317
-
318
- Save new results to cache:
319
- ```bash
320
- $(cat graphify-out/.graphify_python) -c "
321
- import json
322
- from graphify.cache import save_semantic_cache
323
- from pathlib import Path
324
-
325
- new = json.loads(Path('graphify-out/.graphify_semantic_new.json').read_text()) if Path('graphify-out/.graphify_semantic_new.json').exists() else {'nodes':[],'edges':[],'hyperedges':[]}
326
- saved = save_semantic_cache(new.get('nodes', []), new.get('edges', []), new.get('hyperedges', []))
327
- print(f'Cached {saved} files')
328
- "
329
- ```
330
-
331
- Merge cached + new results into `graphify-out/.graphify_semantic.json`:
332
- ```bash
333
- $(cat graphify-out/.graphify_python) -c "
334
- import json
335
- from pathlib import Path
336
-
337
- cached = json.loads(Path('graphify-out/.graphify_cached.json').read_text()) if Path('graphify-out/.graphify_cached.json').exists() else {'nodes':[],'edges':[],'hyperedges':[]}
338
- new = json.loads(Path('graphify-out/.graphify_semantic_new.json').read_text()) if Path('graphify-out/.graphify_semantic_new.json').exists() else {'nodes':[],'edges':[],'hyperedges':[]}
339
-
340
- all_nodes = cached['nodes'] + new.get('nodes', [])
341
- all_edges = cached['edges'] + new.get('edges', [])
342
- all_hyperedges = cached.get('hyperedges', []) + new.get('hyperedges', [])
343
- seen = set()
344
- deduped = []
345
- for n in all_nodes:
346
- if n['id'] not in seen:
347
- seen.add(n['id'])
348
- deduped.append(n)
349
-
350
- merged = {
351
- 'nodes': deduped,
352
- 'edges': all_edges,
353
- 'hyperedges': all_hyperedges,
354
- 'input_tokens': new.get('input_tokens', 0),
355
- 'output_tokens': new.get('output_tokens', 0),
356
- }
357
- Path('graphify-out/.graphify_semantic.json').write_text(json.dumps(merged, indent=2))
358
- print(f'Extraction complete - {len(deduped)} nodes, {len(all_edges)} edges ({len(cached[\"nodes\"])} from cache, {len(new.get(\"nodes\",[]))} new)')
359
- "
360
- ```
361
- Clean up temp files: `rm -f graphify-out/.graphify_cached.json graphify-out/.graphify_uncached.txt graphify-out/.graphify_semantic_new.json`
362
-
363
- #### Part C - Merge AST + semantic into final extraction
364
-
365
- ```bash
366
- $(cat graphify-out/.graphify_python) -c "
367
- import sys, json
368
- from pathlib import Path
369
-
370
- ast = json.loads(Path('graphify-out/.graphify_ast.json').read_text())
371
- sem = json.loads(Path('graphify-out/.graphify_semantic.json').read_text())
372
-
373
- # Merge: AST nodes first, semantic nodes deduplicated by id
374
- seen = {n['id'] for n in ast['nodes']}
375
- merged_nodes = list(ast['nodes'])
376
- for n in sem['nodes']:
377
- if n['id'] not in seen:
378
- merged_nodes.append(n)
379
- seen.add(n['id'])
380
-
381
- merged_edges = ast['edges'] + sem['edges']
382
- merged_hyperedges = sem.get('hyperedges', [])
383
- merged = {
384
- 'nodes': merged_nodes,
385
- 'edges': merged_edges,
386
- 'hyperedges': merged_hyperedges,
387
- 'input_tokens': sem.get('input_tokens', 0),
388
- 'output_tokens': sem.get('output_tokens', 0),
389
- }
390
- Path('graphify-out/.graphify_extract.json').write_text(json.dumps(merged, indent=2))
391
- total = len(merged_nodes)
392
- edges = len(merged_edges)
393
- print(f'Merged: {total} nodes, {edges} edges ({len(ast[\"nodes\"])} AST + {len(sem[\"nodes\"])} semantic)')
394
- "
395
- ```
396
-
397
- ### Step 4 - Build graph, cluster, analyze, generate outputs
398
-
399
- **Before starting:** note whether `--directed` was given. If so, pass `directed=True` to `build_from_json()` in the code block below. This builds a `DiGraph` that preserves edge direction (source→target) instead of the default undirected `Graph`.
400
-
401
- ```bash
402
- mkdir -p graphify-out
403
- $(cat graphify-out/.graphify_python) -c "
404
- import sys, json
405
- from graphify.build import build_from_json
406
- from graphify.cluster import cluster, score_all
407
- from graphify.analyze import god_nodes, surprising_connections, suggest_questions
408
- from graphify.report import generate
409
- from graphify.export import to_json
410
- from pathlib import Path
411
-
412
- extraction = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
413
- detection = json.loads(Path('graphify-out/.graphify_detect.json').read_text())
414
-
415
- G = build_from_json(extraction)
416
- communities = cluster(G)
417
- cohesion = score_all(G, communities)
418
- tokens = {'input': extraction.get('input_tokens', 0), 'output': extraction.get('output_tokens', 0)}
419
- gods = god_nodes(G)
420
- surprises = surprising_connections(G, communities)
421
- labels = {cid: 'Community ' + str(cid) for cid in communities}
422
- # Placeholder questions - regenerated with real labels in Step 5
423
- questions = suggest_questions(G, communities, labels)
424
-
425
- report = generate(G, communities, cohesion, labels, gods, surprises, detection, tokens, 'INPUT_PATH', suggested_questions=questions)
426
- Path('graphify-out/GRAPH_REPORT.md').write_text(report)
427
- to_json(G, communities, 'graphify-out/graph.json')
428
-
429
- analysis = {
430
- 'communities': {str(k): v for k, v in communities.items()},
431
- 'cohesion': {str(k): v for k, v in cohesion.items()},
432
- 'gods': gods,
433
- 'surprises': surprises,
434
- 'questions': questions,
435
- }
436
- Path('graphify-out/.graphify_analysis.json').write_text(json.dumps(analysis, indent=2))
437
- if G.number_of_nodes() == 0:
438
- print('ERROR: Graph is empty - extraction produced no nodes.')
439
- print('Possible causes: all files were skipped, binary-only corpus, or extraction failed.')
440
- raise SystemExit(1)
441
- print(f'Graph: {G.number_of_nodes()} nodes, {G.number_of_edges()} edges, {len(communities)} communities')
442
- "
443
- ```
444
-
445
- If this step prints `ERROR: Graph is empty`, stop and tell the user what happened - do not proceed to labeling or visualization.
446
-
447
- Replace INPUT_PATH with the actual path.
448
-
449
- ### Step 5 - Label communities
450
-
451
- Read `graphify-out/.graphify_analysis.json`. For each community key, look at its node labels and write a 2-5 word plain-language name (e.g. "Attention Mechanism", "Training Pipeline", "Data Loading").
452
-
453
- Then regenerate the report and save the labels for the visualizer:
454
-
455
- ```bash
456
- $(cat graphify-out/.graphify_python) -c "
457
- import sys, json
458
- from graphify.build import build_from_json
459
- from graphify.cluster import score_all
460
- from graphify.analyze import god_nodes, surprising_connections, suggest_questions
461
- from graphify.report import generate
462
- from pathlib import Path
463
-
464
- extraction = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
465
- detection = json.loads(Path('graphify-out/.graphify_detect.json').read_text())
466
- analysis = json.loads(Path('graphify-out/.graphify_analysis.json').read_text())
467
-
468
- G = build_from_json(extraction)
469
- communities = {int(k): v for k, v in analysis['communities'].items()}
470
- cohesion = {int(k): v for k, v in analysis['cohesion'].items()}
471
- tokens = {'input': extraction.get('input_tokens', 0), 'output': extraction.get('output_tokens', 0)}
472
-
473
- # LABELS - replace these with the names you chose above
474
- labels = LABELS_DICT
475
-
476
- # Regenerate questions with real community labels (labels affect question phrasing)
477
- questions = suggest_questions(G, communities, labels)
478
-
479
- report = generate(G, communities, cohesion, labels, analysis['gods'], analysis['surprises'], detection, tokens, 'INPUT_PATH', suggested_questions=questions)
480
- Path('graphify-out/GRAPH_REPORT.md').write_text(report)
481
- Path('graphify-out/.graphify_labels.json').write_text(json.dumps({str(k): v for k, v in labels.items()}))
482
- print('Report updated with community labels')
483
- "
484
- ```
485
-
486
- Replace `LABELS_DICT` with the actual dict you constructed (e.g. `{0: "Attention Mechanism", 1: "Training Pipeline"}`).
487
- Replace INPUT_PATH with the actual path.
488
-
489
- ### Step 6 - Generate Obsidian vault (opt-in) + HTML
490
-
491
- **Generate HTML always** (unless `--no-viz`). **Obsidian vault only if `--obsidian` was explicitly given** — skip it otherwise, it generates one file per node.
492
-
493
- If `--obsidian` was given:
494
-
495
- - If `--obsidian-dir <path>` was also given, use that path as the vault directory. Otherwise default to `graphify-out/obsidian`.
496
-
497
- ```bash
498
- $(cat graphify-out/.graphify_python) -c "
499
- import sys, json
500
- from graphify.build import build_from_json
501
- from graphify.export import to_obsidian, to_canvas
502
- from pathlib import Path
503
-
504
- extraction = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
505
- analysis = json.loads(Path('graphify-out/.graphify_analysis.json').read_text())
506
- labels_raw = json.loads(Path('graphify-out/.graphify_labels.json').read_text()) if Path('graphify-out/.graphify_labels.json').exists() else {}
507
-
508
- G = build_from_json(extraction)
509
- communities = {int(k): v for k, v in analysis['communities'].items()}
510
- cohesion = {int(k): v for k, v in analysis['cohesion'].items()}
511
- labels = {int(k): v for k, v in labels_raw.items()}
512
-
513
- obsidian_dir = 'OBSIDIAN_DIR' # replace with --obsidian-dir value, or 'graphify-out/obsidian' if not given
514
-
515
- n = to_obsidian(G, communities, obsidian_dir, community_labels=labels or None, cohesion=cohesion)
516
- print(f'Obsidian vault: {n} notes in {obsidian_dir}/')
517
-
518
- to_canvas(G, communities, f'{obsidian_dir}/graph.canvas', community_labels=labels or None)
519
- print(f'Canvas: {obsidian_dir}/graph.canvas - open in Obsidian for structured community layout')
520
- print()
521
- print(f'Open {obsidian_dir}/ as a vault in Obsidian.')
522
- print(' Graph view - nodes colored by community (set automatically)')
523
- print(' graph.canvas - structured layout with communities as groups')
524
- print(' _COMMUNITY_* - overview notes with cohesion scores and dataview queries')
525
- "
526
- ```
527
-
528
- Generate the HTML graph (always, unless `--no-viz`):
529
-
530
- ```bash
531
- $(cat graphify-out/.graphify_python) -c "
532
- import sys, json
533
- from graphify.build import build_from_json
534
- from graphify.export import to_html
535
- from pathlib import Path
536
-
537
- extraction = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
538
- analysis = json.loads(Path('graphify-out/.graphify_analysis.json').read_text())
539
- labels_raw = json.loads(Path('graphify-out/.graphify_labels.json').read_text()) if Path('graphify-out/.graphify_labels.json').exists() else {}
540
-
541
- G = build_from_json(extraction)
542
- communities = {int(k): v for k, v in analysis['communities'].items()}
543
- labels = {int(k): v for k, v in labels_raw.items()}
544
-
545
- if G.number_of_nodes() > 5000:
546
- print(f'Graph has {G.number_of_nodes()} nodes - too large for HTML viz. Use Obsidian vault instead.')
547
- else:
548
- to_html(G, communities, 'graphify-out/graph.html', community_labels=labels or None)
549
- print('graph.html written - open in any browser, no server needed')
550
- "
551
- ```
552
-
553
- ### Step 6b - Wiki (only if --wiki flag)
554
-
555
- **Only run this step if `--wiki` was explicitly given in the original command.**
556
-
557
- Run this before Step 9 (cleanup) so `.graphify_labels.json` is still available.
558
-
559
- ```bash
560
- $(cat graphify-out/.graphify_python) -c "
561
- import json
562
- from graphify.build import build_from_json
563
- from graphify.wiki import to_wiki
564
- from graphify.analyze import god_nodes
565
- from pathlib import Path
566
-
567
- extraction = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
568
- analysis = json.loads(Path('graphify-out/.graphify_analysis.json').read_text())
569
- labels_raw = json.loads(Path('graphify-out/.graphify_labels.json').read_text()) if Path('graphify-out/.graphify_labels.json').exists() else {}
570
-
571
- G = build_from_json(extraction)
572
- communities = {int(k): v for k, v in analysis['communities'].items()}
573
- cohesion = {int(k): v for k, v in analysis['cohesion'].items()}
574
- labels = {int(k): v for k, v in labels_raw.items()}
575
- gods = god_nodes(G)
576
-
577
- n = to_wiki(G, communities, 'graphify-out/wiki', community_labels=labels or None, cohesion=cohesion, god_nodes_data=gods)
578
- print(f'Wiki: {n} articles written to graphify-out/wiki/')
579
- print(' graphify-out/wiki/index.md -> agent entry point')
580
- "
581
- ```
582
-
583
- ### Step 7 - Neo4j export (only if --neo4j or --neo4j-push flag)
584
-
585
- **If `--neo4j`** - generate a Cypher file for manual import:
586
-
587
- ```bash
588
- $(cat graphify-out/.graphify_python) -c "
589
- import sys, json
590
- from graphify.build import build_from_json
591
- from graphify.export import to_cypher
592
- from pathlib import Path
593
-
594
- G = build_from_json(json.loads(Path('graphify-out/.graphify_extract.json').read_text()))
595
- to_cypher(G, 'graphify-out/cypher.txt')
596
- print('cypher.txt written - import with: cypher-shell < graphify-out/cypher.txt')
597
- "
598
- ```
599
-
600
- **If `--neo4j-push <uri>`** - push directly to a running Neo4j instance. Ask the user for credentials if not provided:
601
-
602
- ```bash
603
- $(cat graphify-out/.graphify_python) -c "
604
- import sys, json
605
- from graphify.build import build_from_json
606
- from graphify.cluster import cluster
607
- from graphify.export import push_to_neo4j
608
- from pathlib import Path
609
-
610
- extraction = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
611
- analysis = json.loads(Path('graphify-out/.graphify_analysis.json').read_text())
612
- G = build_from_json(extraction)
613
- communities = {int(k): v for k, v in analysis['communities'].items()}
614
-
615
- result = push_to_neo4j(G, uri='NEO4J_URI', user='NEO4J_USER', password='NEO4J_PASSWORD', communities=communities)
616
- print(f'Pushed to Neo4j: {result[\"nodes\"]} nodes, {result[\"edges\"]} edges')
617
- "
618
- ```
619
-
620
- Replace `NEO4J_URI`, `NEO4J_USER`, `NEO4J_PASSWORD` with actual values. Default URI is `bolt://localhost:7687`, default user is `neo4j`. Uses MERGE - safe to re-run without creating duplicates.
621
-
622
- ### Step 7b - SVG export (only if --svg flag)
623
-
624
- ```bash
625
- $(cat graphify-out/.graphify_python) -c "
626
- import sys, json
627
- from graphify.build import build_from_json
628
- from graphify.export import to_svg
629
- from pathlib import Path
630
-
631
- extraction = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
632
- analysis = json.loads(Path('graphify-out/.graphify_analysis.json').read_text())
633
- labels_raw = json.loads(Path('graphify-out/.graphify_labels.json').read_text()) if Path('graphify-out/.graphify_labels.json').exists() else {}
634
-
635
- G = build_from_json(extraction)
636
- communities = {int(k): v for k, v in analysis['communities'].items()}
637
- labels = {int(k): v for k, v in labels_raw.items()}
638
-
639
- to_svg(G, communities, 'graphify-out/graph.svg', community_labels=labels or None)
640
- print('graph.svg written - embeds in Obsidian, Notion, GitHub READMEs')
641
- "
642
- ```
643
-
644
- ### Step 7c - GraphML export (only if --graphml flag)
645
-
646
- ```bash
647
- $(cat graphify-out/.graphify_python) -c "
648
- import json
649
- from graphify.build import build_from_json
650
- from graphify.export import to_graphml
651
- from pathlib import Path
652
-
653
- extraction = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
654
- analysis = json.loads(Path('graphify-out/.graphify_analysis.json').read_text())
655
-
656
- G = build_from_json(extraction)
657
- communities = {int(k): v for k, v in analysis['communities'].items()}
658
-
659
- to_graphml(G, communities, 'graphify-out/graph.graphml')
660
- print('graph.graphml written - open in Gephi, yEd, or any GraphML tool')
661
- "
662
- ```
663
-
664
- ### Step 7d - MCP server (only if --mcp flag)
665
-
666
- ```bash
667
- python3 -m graphify.serve graphify-out/graph.json
668
- ```
669
-
670
- This starts a stdio MCP server that exposes tools: `query_graph`, `get_node`, `get_neighbors`, `get_community`, `god_nodes`, `graph_stats`, `shortest_path`. Add to Claude Desktop or any MCP-compatible agent orchestrator so other agents can query the graph live.
671
-
672
- To configure in Claude Desktop, add to `claude_desktop_config.json`:
673
- ```json
674
- {
675
- "mcpServers": {
676
- "graphify": {
677
- "command": "python3",
678
- "args": ["-m", "graphify.serve", "/absolute/path/to/graphify-out/graph.json"]
679
- }
680
- }
681
- }
682
- ```
683
-
684
- ### Step 8 - Token reduction benchmark (only if total_words > 5000)
685
-
686
- If `total_words` from `graphify-out/.graphify_detect.json` is greater than 5,000, run:
687
-
688
- ```bash
689
- $(cat graphify-out/.graphify_python) -c "
690
- import json
691
- from graphify.benchmark import run_benchmark, print_benchmark
692
- from pathlib import Path
693
-
694
- detection = json.loads(Path('graphify-out/.graphify_detect.json').read_text())
695
- result = run_benchmark('graphify-out/graph.json', corpus_words=detection['total_words'])
696
- print_benchmark(result)
697
- "
698
- ```
699
-
700
- Print the output directly in chat. If `total_words <= 5000`, skip silently - the graph value is structural clarity, not token compression, for small corpora.
701
-
702
- ---
703
-
704
- ### Step 9 - Save manifest, update cost tracker, clean up, and report
705
-
706
- ```bash
707
- $(cat graphify-out/.graphify_python) -c "
708
- import json
709
- from pathlib import Path
710
- from datetime import datetime, timezone
711
- from graphify.detect import save_manifest
712
-
713
- # Save manifest for --update
714
- detect = json.loads(Path('graphify-out/.graphify_detect.json').read_text())
715
- save_manifest(detect['files'])
716
-
717
- # Update cumulative cost tracker
718
- extract = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
719
- input_tok = extract.get('input_tokens', 0)
720
- output_tok = extract.get('output_tokens', 0)
721
-
722
- cost_path = Path('graphify-out/cost.json')
723
- if cost_path.exists():
724
- cost = json.loads(cost_path.read_text())
725
- else:
726
- cost = {'runs': [], 'total_input_tokens': 0, 'total_output_tokens': 0}
727
-
728
- cost['runs'].append({
729
- 'date': datetime.now(timezone.utc).isoformat(),
730
- 'input_tokens': input_tok,
731
- 'output_tokens': output_tok,
732
- 'files': detect.get('total_files', 0),
733
- })
734
- cost['total_input_tokens'] += input_tok
735
- cost['total_output_tokens'] += output_tok
736
- cost_path.write_text(json.dumps(cost, indent=2))
737
-
738
- print(f'This run: {input_tok:,} input tokens, {output_tok:,} output tokens')
739
- print(f'All time: {cost[\"total_input_tokens\"]:,} input, {cost[\"total_output_tokens\"]:,} output ({len(cost[\"runs\"])} runs)')
740
- "
741
- rm -f graphify-out/.graphify_detect.json graphify-out/.graphify_extract.json graphify-out/.graphify_ast.json graphify-out/.graphify_semantic.json graphify-out/.graphify_analysis.json graphify-out/.graphify_labels.json
742
- rm -f graphify-out/.needs_update 2>/dev/null || true
743
- ```
744
-
745
- Tell the user (omit the obsidian line unless --obsidian was given):
746
- ```
747
- Graph complete. Outputs in PATH_TO_DIR/graphify-out/
748
-
749
- graph.html - interactive graph, open in browser
750
- GRAPH_REPORT.md - audit report
751
- graph.json - raw graph data
752
- obsidian/ - Obsidian vault (only if --obsidian was given)
753
- ```
754
-
755
- If graphify saved you time, consider supporting it: https://github.com/sponsors/safishamsi
756
-
757
- Replace PATH_TO_DIR with the actual absolute path of the directory that was processed.
758
-
759
- Then paste these sections from GRAPH_REPORT.md directly into the chat:
760
- - God Nodes
761
- - Surprising Connections
762
- - Suggested Questions
763
-
764
- Do NOT paste the full report - just those three sections. Keep it concise.
765
-
766
- Then immediately offer to explore. Pick the single most interesting suggested question from the report - the one that crosses the most community boundaries or has the most surprising bridge node - and ask:
767
-
768
- > "The most interesting question this graph can answer: **[question]**. Want me to trace it?"
769
-
770
- If the user says yes, run `/graphify query "[question]"` on the graph and walk them through the answer using the graph structure - which nodes connect, which community boundaries get crossed, what the path reveals. Keep going as long as they want to explore. Each answer should end with a natural follow-up ("this connects to X - want to go deeper?") so the session feels like navigation, not a one-shot report.
771
-
772
- The graph is the map. Your job after the pipeline is to be the guide.
773
-
774
- ---
775
-
776
- ## Interpreter guard for subcommands
777
-
778
- Before running any subcommand below (`--update`, `--cluster-only`, `query`, `path`, `explain`, `add`), check that `.graphify_python` exists. If it's missing (e.g. user deleted `graphify-out/`), re-resolve the interpreter first:
779
-
780
- ```bash
781
- if [ ! -f graphify-out/.graphify_python ]; then
782
- GRAPHIFY_BIN=$(which graphify 2>/dev/null)
783
- if [ -n "$GRAPHIFY_BIN" ]; then
784
- PYTHON=$(head -1 "$GRAPHIFY_BIN" | tr -d '#!')
785
- case "$PYTHON" in *[!a-zA-Z0-9/_.-]*) PYTHON="python3" ;; esac
786
- else
787
- PYTHON="python3"
788
- fi
789
- mkdir -p graphify-out
790
- "$PYTHON" -c "import sys; open('graphify-out/.graphify_python', 'w').write(sys.executable)"
791
- fi
792
- ```
793
-
794
- ## For --update (incremental re-extraction)
795
-
796
- Use when you've added or modified files since the last run. Only re-extracts changed files - saves tokens and time.
797
-
798
- ```bash
799
- $(cat graphify-out/.graphify_python) -c "
800
- import sys, json
801
- from graphify.detect import detect_incremental, save_manifest
802
- from pathlib import Path
803
-
804
- result = detect_incremental(Path('INPUT_PATH'))
805
- new_total = result.get('new_total', 0)
806
- print(json.dumps(result, indent=2))
807
- Path('graphify-out/.graphify_incremental.json').write_text(json.dumps(result))
808
- if new_total == 0:
809
- print('No files changed since last run. Nothing to update.')
810
- raise SystemExit(0)
811
- print(f'{new_total} new/changed file(s) to re-extract.')
812
- "
813
- ```
814
-
815
- If new files exist, first check whether all changed files are code files:
816
-
817
- ```bash
818
- $(cat graphify-out/.graphify_python) -c "
819
- import json
820
- from pathlib import Path
821
-
822
- result = json.loads(open('graphify-out/.graphify_incremental.json').read()) if Path('graphify-out/.graphify_incremental.json').exists() else {}
823
- code_exts = {'.py','.ts','.js','.go','.rs','.java','.cpp','.c','.rb','.swift','.kt','.cs','.scala','.php','.cc','.cxx','.hpp','.h','.kts','.lua','.toc'}
824
- new_files = result.get('new_files', {})
825
- all_changed = [f for files in new_files.values() for f in files]
826
- code_only = all(Path(f).suffix.lower() in code_exts for f in all_changed)
827
- print('code_only:', code_only)
828
- "
829
- ```
830
-
831
- If `code_only` is True: print `[graphify update] Code-only changes detected - skipping semantic extraction (no LLM needed)`, run only Step 3A (AST) on the changed files, skip Step 3B entirely (no subagents), then go straight to merge and Steps 4–8.
832
-
833
- If `code_only` is False (any changed file is a doc/paper/image): run the full Steps 3A–3C pipeline as normal.
834
-
835
- Then:
836
-
837
- ```bash
838
- $(cat graphify-out/.graphify_python) -c "
839
- import sys, json
840
- from graphify.build import build_from_json
841
- from graphify.export import to_json
842
- from networkx.readwrite import json_graph
843
- import networkx as nx
844
- from pathlib import Path
845
-
846
- # Load existing graph
847
- existing_data = json.loads(Path('graphify-out/graph.json').read_text())
848
- G_existing = json_graph.node_link_graph(existing_data, edges='links')
849
-
850
- # Load new extraction
851
- new_extraction = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
852
- G_new = build_from_json(new_extraction)
853
-
854
- # Prune nodes from deleted files
855
- incremental = json.loads(Path('graphify-out/.graphify_incremental.json').read_text())
856
- deleted = set(incremental.get('deleted_files', []))
857
- if deleted:
858
- to_remove = [n for n, d in G_existing.nodes(data=True) if d.get('source_file') in deleted]
859
- G_existing.remove_nodes_from(to_remove)
860
- print(f'Pruned {len(to_remove)} ghost nodes from {len(deleted)} deleted file(s)')
861
-
862
- # Merge: new nodes/edges into existing graph
863
- G_existing.update(G_new)
864
- print(f'Merged: {G_existing.number_of_nodes()} nodes, {G_existing.number_of_edges()} edges')
865
-
866
- # Write merged result back to .graphify_extract.json so Step 4 sees the full graph
867
- merged_out = {
868
- 'nodes': [{'id': n, **d} for n, d in G_existing.nodes(data=True)],
869
- 'edges': [{'source': u, 'target': v, **d} for u, v, d in G_existing.edges(data=True)],
870
- 'hyperedges': new_extraction.get('hyperedges', []),
871
- 'input_tokens': new_extraction.get('input_tokens', 0),
872
- 'output_tokens': new_extraction.get('output_tokens', 0),
873
- }
874
- Path('graphify-out/.graphify_extract.json').write_text(json.dumps(merged_out))
875
- print(f'[graphify update] Merged extraction written ({len(merged_out[\"nodes\"])} nodes, {len(merged_out[\"edges\"])} edges)')
876
- "
877
- ```
878
-
879
- Then run Steps 4–8 on the merged graph as normal.
880
-
881
- After Step 4, show the graph diff:
882
-
883
- ```bash
884
- $(cat graphify-out/.graphify_python) -c "
885
- import json
886
- from graphify.analyze import graph_diff
887
- from graphify.build import build_from_json
888
- from networkx.readwrite import json_graph
889
- import networkx as nx
890
- from pathlib import Path
891
-
892
- # Load old graph (before update) from backup written before merge
893
- old_data = json.loads(Path('graphify-out/.graphify_old.json').read_text()) if Path('graphify-out/.graphify_old.json').exists() else None
894
- new_extract = json.loads(Path('graphify-out/.graphify_extract.json').read_text())
895
- G_new = build_from_json(new_extract)
896
-
897
- if old_data:
898
- G_old = json_graph.node_link_graph(old_data, edges='links')
899
- diff = graph_diff(G_old, G_new)
900
- print(diff['summary'])
901
- if diff['new_nodes']:
902
- print('New nodes:', ', '.join(n['label'] for n in diff['new_nodes'][:5]))
903
- if diff['new_edges']:
904
- print('New edges:', len(diff['new_edges']))
905
- "
906
- ```
907
-
908
- Before the merge step, save the old graph: `cp graphify-out/graph.json graphify-out/.graphify_old.json`
909
- Clean up after: `rm -f graphify-out/.graphify_old.json`
910
-
911
- ---
912
-
913
- ## For --cluster-only
914
-
915
- Skip Steps 1–3. Load the existing graph from `graphify-out/graph.json` and re-run clustering:
916
-
917
- ```bash
918
- $(cat graphify-out/.graphify_python) -c "
919
- import sys, json
920
- from graphify.cluster import cluster, score_all
921
- from graphify.analyze import god_nodes, surprising_connections
922
- from graphify.report import generate
923
- from graphify.export import to_json
924
- from networkx.readwrite import json_graph
925
- import networkx as nx
926
- from pathlib import Path
927
-
928
- data = json.loads(Path('graphify-out/graph.json').read_text())
929
- G = json_graph.node_link_graph(data, edges='links')
930
-
931
- detection = {'total_files': 0, 'total_words': 99999, 'needs_graph': True, 'warning': None,
932
- 'files': {'code': [], 'document': [], 'paper': []}}
933
- tokens = {'input': 0, 'output': 0}
934
-
935
- communities = cluster(G)
936
- cohesion = score_all(G, communities)
937
- gods = god_nodes(G)
938
- surprises = surprising_connections(G, communities)
939
- labels = {cid: 'Community ' + str(cid) for cid in communities}
940
-
941
- report = generate(G, communities, cohesion, labels, gods, surprises, detection, tokens, '.')
942
- Path('graphify-out/GRAPH_REPORT.md').write_text(report)
943
- to_json(G, communities, 'graphify-out/graph.json')
944
-
945
- analysis = {
946
- 'communities': {str(k): v for k, v in communities.items()},
947
- 'cohesion': {str(k): v for k, v in cohesion.items()},
948
- 'gods': gods,
949
- 'surprises': surprises,
950
- }
951
- Path('graphify-out/.graphify_analysis.json').write_text(json.dumps(analysis, indent=2))
952
- print(f'Re-clustered: {len(communities)} communities')
953
- "
954
- ```
955
-
956
- Then run Steps 5–9 as normal (label communities, generate viz, benchmark, clean up, report).
957
-
958
- ---
959
-
960
- ## For /graphify query
961
-
962
- Two traversal modes - choose based on the question:
963
-
964
- | Mode | Flag | Best for |
965
- |------|------|----------|
966
- | BFS (default) | _(none)_ | "What is X connected to?" - broad context, nearest neighbors first |
967
- | DFS | `--dfs` | "How does X reach Y?" - trace a specific chain or dependency path |
968
-
969
- First check the graph exists:
970
- ```bash
971
- $(cat graphify-out/.graphify_python) -c "
972
- from pathlib import Path
973
- if not Path('graphify-out/graph.json').exists():
974
- print('ERROR: No graph found. Run /graphify <path> first to build the graph.')
975
- raise SystemExit(1)
976
- "
977
- ```
978
- If it fails, stop and tell the user to run `/graphify <path>` first.
979
-
980
- Load `graphify-out/graph.json`, then:
981
-
982
- 1. Find the 1-3 nodes whose label best matches key terms in the question.
983
- 2. Run the appropriate traversal from each starting node.
984
- 3. Read the subgraph - node labels, edge relations, confidence tags, source locations.
985
- 4. Answer using **only** what the graph contains. Quote `source_location` when citing a specific fact.
986
- 5. If the graph lacks enough information, say so - do not hallucinate edges.
987
-
988
- ```bash
989
- $(cat graphify-out/.graphify_python) -c "
990
- import sys, json
991
- from networkx.readwrite import json_graph
992
- import networkx as nx
993
- from pathlib import Path
994
-
995
- data = json.loads(Path('graphify-out/graph.json').read_text())
996
- G = json_graph.node_link_graph(data, edges='links')
997
-
998
- question = 'QUESTION'
999
- mode = 'MODE' # 'bfs' or 'dfs'
1000
- terms = [t.lower() for t in question.split() if len(t) > 3]
1001
-
1002
- # Find best-matching start nodes
1003
- scored = []
1004
- for nid, ndata in G.nodes(data=True):
1005
- label = ndata.get('label', '').lower()
1006
- score = sum(1 for t in terms if t in label)
1007
- if score > 0:
1008
- scored.append((score, nid))
1009
- scored.sort(reverse=True)
1010
- start_nodes = [nid for _, nid in scored[:3]]
1011
-
1012
- if not start_nodes:
1013
- print('No matching nodes found for query terms:', terms)
1014
- sys.exit(0)
1015
-
1016
- subgraph_nodes = set()
1017
- subgraph_edges = []
1018
-
1019
- if mode == 'dfs':
1020
- # DFS: follow one path as deep as possible before backtracking.
1021
- # Depth-limited to 6 to avoid traversing the whole graph.
1022
- visited = set()
1023
- stack = [(n, 0) for n in reversed(start_nodes)]
1024
- while stack:
1025
- node, depth = stack.pop()
1026
- if node in visited or depth > 6:
1027
- continue
1028
- visited.add(node)
1029
- subgraph_nodes.add(node)
1030
- for neighbor in G.neighbors(node):
1031
- if neighbor not in visited:
1032
- stack.append((neighbor, depth + 1))
1033
- subgraph_edges.append((node, neighbor))
1034
- else:
1035
- # BFS: explore all neighbors layer by layer up to depth 3.
1036
- frontier = set(start_nodes)
1037
- subgraph_nodes = set(start_nodes)
1038
- for _ in range(3):
1039
- next_frontier = set()
1040
- for n in frontier:
1041
- for neighbor in G.neighbors(n):
1042
- if neighbor not in subgraph_nodes:
1043
- next_frontier.add(neighbor)
1044
- subgraph_edges.append((n, neighbor))
1045
- subgraph_nodes.update(next_frontier)
1046
- frontier = next_frontier
1047
-
1048
- # Token-budget aware output: rank by relevance, cut at budget (~4 chars/token)
1049
- token_budget = BUDGET # default 2000
1050
- char_budget = token_budget * 4
1051
-
1052
- # Score each node by term overlap for ranked output
1053
- def relevance(nid):
1054
- label = G.nodes[nid].get('label', '').lower()
1055
- return sum(1 for t in terms if t in label)
1056
-
1057
- ranked_nodes = sorted(subgraph_nodes, key=relevance, reverse=True)
1058
-
1059
- lines = [f'Traversal: {mode.upper()} | Start: {[G.nodes[n].get(\"label\",n) for n in start_nodes]} | {len(subgraph_nodes)} nodes']
1060
- for nid in ranked_nodes:
1061
- d = G.nodes[nid]
1062
- lines.append(f' NODE {d.get(\"label\", nid)} [src={d.get(\"source_file\",\"\")} loc={d.get(\"source_location\",\"\")}]')
1063
- for u, v in subgraph_edges:
1064
- if u in subgraph_nodes and v in subgraph_nodes:
1065
- d = G.edges[u, v]
1066
- lines.append(f' EDGE {G.nodes[u].get(\"label\",u)} --{d.get(\"relation\",\"\")} [{d.get(\"confidence\",\"\")}]--> {G.nodes[v].get(\"label\",v)}')
1067
-
1068
- output = '\n'.join(lines)
1069
- if len(output) > char_budget:
1070
- output = output[:char_budget] + f'\n... (truncated at ~{token_budget} token budget - use --budget N for more)'
1071
- print(output)
1072
- "
1073
- ```
1074
-
1075
- Replace `QUESTION` with the user's actual question, `MODE` with `bfs` or `dfs`, and `BUDGET` with the token budget (default `2000`, or whatever `--budget N` specifies). Then answer based on the subgraph output above.
1076
-
1077
- After writing the answer, save it back into the graph so it improves future queries:
1078
-
1079
- ```bash
1080
- $(cat graphify-out/.graphify_python) -m graphify save-result --question "QUESTION" --answer "ANSWER" --type query --nodes NODE1 NODE2
1081
- ```
1082
-
1083
- Replace `QUESTION` with the question, `ANSWER` with your full answer text, `SOURCE_NODES` with the list of node labels you cited. This closes the feedback loop: the next `--update` will extract this Q&A as a node in the graph.
1084
-
1085
- ---
1086
-
1087
- ## For /graphify path
1088
-
1089
- Find the shortest path between two named concepts in the graph.
1090
-
1091
- First check the graph exists:
1092
- ```bash
1093
- $(cat graphify-out/.graphify_python) -c "
1094
- from pathlib import Path
1095
- if not Path('graphify-out/graph.json').exists():
1096
- print('ERROR: No graph found. Run /graphify <path> first to build the graph.')
1097
- raise SystemExit(1)
1098
- "
1099
- ```
1100
- If it fails, stop and tell the user to run `/graphify <path>` first.
1101
-
1102
- ```bash
1103
- $(cat graphify-out/.graphify_python) -c "
1104
- import json, sys
1105
- import networkx as nx
1106
- from networkx.readwrite import json_graph
1107
- from pathlib import Path
1108
-
1109
- data = json.loads(Path('graphify-out/graph.json').read_text())
1110
- G = json_graph.node_link_graph(data, edges='links')
1111
-
1112
- a_term = 'NODE_A'
1113
- b_term = 'NODE_B'
1114
-
1115
- def find_node(term):
1116
- term = term.lower()
1117
- scored = sorted(
1118
- [(sum(1 for w in term.split() if w in G.nodes[n].get('label','').lower()), n)
1119
- for n in G.nodes()],
1120
- reverse=True
1121
- )
1122
- return scored[0][1] if scored and scored[0][0] > 0 else None
1123
-
1124
- src = find_node(a_term)
1125
- tgt = find_node(b_term)
1126
-
1127
- if not src or not tgt:
1128
- print(f'Could not find nodes matching: {a_term!r} or {b_term!r}')
1129
- sys.exit(0)
1130
-
1131
- try:
1132
- path = nx.shortest_path(G, src, tgt)
1133
- print(f'Shortest path ({len(path)-1} hops):')
1134
- for i, nid in enumerate(path):
1135
- label = G.nodes[nid].get('label', nid)
1136
- if i < len(path) - 1:
1137
- edge = G.edges[nid, path[i+1]]
1138
- rel = edge.get('relation', '')
1139
- conf = edge.get('confidence', '')
1140
- print(f' {label} --{rel}--> [{conf}]')
1141
- else:
1142
- print(f' {label}')
1143
- except nx.NetworkXNoPath:
1144
- print(f'No path found between {a_term!r} and {b_term!r}')
1145
- except nx.NodeNotFound as e:
1146
- print(f'Node not found: {e}')
1147
- "
1148
- ```
1149
-
1150
- Replace `NODE_A` and `NODE_B` with the actual concept names from the user. Then explain the path in plain language - what each hop means, why it's significant.
1151
-
1152
- After writing the explanation, save it back:
1153
-
1154
- ```bash
1155
- $(cat graphify-out/.graphify_python) -m graphify save-result --question "Path from NODE_A to NODE_B" --answer "ANSWER" --type path_query --nodes NODE_A NODE_B
1156
- ```
1157
-
1158
- ---
1159
-
1160
- ## For /graphify explain
1161
-
1162
- Give a plain-language explanation of a single node - everything connected to it.
1163
-
1164
- First check the graph exists:
1165
- ```bash
1166
- $(cat graphify-out/.graphify_python) -c "
1167
- from pathlib import Path
1168
- if not Path('graphify-out/graph.json').exists():
1169
- print('ERROR: No graph found. Run /graphify <path> first to build the graph.')
1170
- raise SystemExit(1)
1171
- "
1172
- ```
1173
- If it fails, stop and tell the user to run `/graphify <path>` first.
1174
-
1175
- ```bash
1176
- $(cat graphify-out/.graphify_python) -c "
1177
- import json, sys
1178
- import networkx as nx
1179
- from networkx.readwrite import json_graph
1180
- from pathlib import Path
1181
-
1182
- data = json.loads(Path('graphify-out/graph.json').read_text())
1183
- G = json_graph.node_link_graph(data, edges='links')
1184
-
1185
- term = 'NODE_NAME'
1186
- term_lower = term.lower()
1187
-
1188
- # Find best matching node
1189
- scored = sorted(
1190
- [(sum(1 for w in term_lower.split() if w in G.nodes[n].get('label','').lower()), n)
1191
- for n in G.nodes()],
1192
- reverse=True
1193
- )
1194
- if not scored or scored[0][0] == 0:
1195
- print(f'No node matching {term!r}')
1196
- sys.exit(0)
1197
-
1198
- nid = scored[0][1]
1199
- data_n = G.nodes[nid]
1200
- print(f'NODE: {data_n.get(\"label\", nid)}')
1201
- print(f' source: {data_n.get(\"source_file\",\"unknown\")}')
1202
- print(f' type: {data_n.get(\"file_type\",\"unknown\")}')
1203
- print(f' degree: {G.degree(nid)}')
1204
- print()
1205
- print('CONNECTIONS:')
1206
- for neighbor in G.neighbors(nid):
1207
- edge = G.edges[nid, neighbor]
1208
- nlabel = G.nodes[neighbor].get('label', neighbor)
1209
- rel = edge.get('relation', '')
1210
- conf = edge.get('confidence', '')
1211
- src_file = G.nodes[neighbor].get('source_file', '')
1212
- print(f' --{rel}--> {nlabel} [{conf}] ({src_file})')
1213
- "
1214
- ```
1215
-
1216
- Replace `NODE_NAME` with the concept the user asked about. Then write a 3-5 sentence explanation of what this node is, what it connects to, and why those connections are significant. Use the source locations as citations.
1217
-
1218
- After writing the explanation, save it back:
1219
-
1220
- ```bash
1221
- $(cat graphify-out/.graphify_python) -m graphify save-result --question "Explain NODE_NAME" --answer "ANSWER" --type explain --nodes NODE_NAME
1222
- ```
1223
-
1224
- ---
1225
-
1226
- ## For /graphify add
1227
-
1228
- Fetch a URL and add it to the corpus, then update the graph.
1229
-
1230
- ```bash
1231
- $(cat graphify-out/.graphify_python) -c "
1232
- import sys
1233
- from graphify.ingest import ingest
1234
- from pathlib import Path
1235
-
1236
- try:
1237
- out = ingest('URL', Path('./raw'), author='AUTHOR', contributor='CONTRIBUTOR')
1238
- print(f'Saved to {out}')
1239
- except ValueError as e:
1240
- print(f'error: {e}', file=sys.stderr)
1241
- sys.exit(1)
1242
- except RuntimeError as e:
1243
- print(f'error: {e}', file=sys.stderr)
1244
- sys.exit(1)
1245
- "
1246
- ```
1247
-
1248
- Replace `URL` with the actual URL, `AUTHOR` with the user's name if provided, `CONTRIBUTOR` likewise. If the command exits with an error, tell the user what went wrong - do not silently continue. After a successful save, automatically run the `--update` pipeline on `./raw` to merge the new file into the existing graph.
1249
-
1250
- Supported URL types (auto-detected):
1251
- - YouTube / any video URL → audio downloaded via yt-dlp, transcribed to `.txt` on next run (requires `pip install 'graphifyy[video]'`)
1252
- - Twitter/X → fetched via oEmbed, saved as `.md` with tweet text and author
1253
- - arXiv → abstract + metadata saved as `.md`
1254
- - PDF → downloaded as `.pdf`
1255
- - Images (.png/.jpg/.webp) → downloaded, Claude vision extracts on next run
1256
- - Any webpage → converted to markdown via html2text
1257
-
1258
- ---
1259
-
1260
- ## For --watch
1261
-
1262
- Start a background watcher that monitors a folder and auto-updates the graph when files change.
1263
-
1264
- ```bash
1265
- python3 -m graphify.watch INPUT_PATH --debounce 3
1266
- ```
1267
-
1268
- Replace INPUT_PATH with the folder to watch. Behavior depends on what changed:
1269
-
1270
- - **Code files only (.py, .ts, .go, etc.):** re-runs AST extraction + rebuild + cluster immediately, no LLM needed. `graph.json` and `GRAPH_REPORT.md` are updated automatically.
1271
- - **Docs, papers, or images:** writes a `graphify-out/needs_update` flag and prints a notification to run `/graphify --update` (LLM semantic re-extraction required).
1272
-
1273
- Debounce (default 3s): waits until file activity stops before triggering, so a wave of parallel agent writes doesn't trigger a rebuild per file.
1274
-
1275
- Press Ctrl+C to stop.
1276
-
1277
- For agentic workflows: run `--watch` in a background terminal. Code changes from agent waves are picked up automatically between waves. If agents are also writing docs or notes, you'll need a manual `/graphify --update` after those waves.
1278
-
1279
- ---
1280
-
1281
- ## For git commit hook
1282
-
1283
- Install a post-commit hook that auto-rebuilds the graph after every commit. No background process needed - triggers once per commit, works with any editor.
1284
-
1285
- ```bash
1286
- graphify hook install # install
1287
- graphify hook uninstall # remove
1288
- graphify hook status # check
1289
- ```
1290
-
1291
- After every `git commit`, the hook detects which code files changed (via `git diff HEAD~1`), re-runs AST extraction on those files, and rebuilds `graph.json` and `GRAPH_REPORT.md`. Doc/image changes are ignored by the hook - run `/graphify --update` manually for those.
1292
-
1293
- If a post-commit hook already exists, graphify appends to it rather than replacing it.
1294
-
1295
- ---
1296
-
1297
- ## For native CLAUDE.md integration
1298
-
1299
- Run once per project to make graphify always-on in Claude Code sessions:
1300
-
1301
- ```bash
1302
- graphify claude install
1303
- ```
1304
-
1305
- This writes a `## graphify` section to the local `CLAUDE.md` that instructs Claude to check the graph before answering codebase questions and rebuild it after code changes. No manual `/graphify` needed in future sessions.
1306
-
1307
- ```bash
1308
- graphify claude uninstall # remove the section
1309
- ```
1310
-
1311
- ---
1312
-
1313
- ## Honesty Rules
1314
-
1315
- - Never invent an edge. If unsure, use AMBIGUOUS.
1316
- - Never skip the corpus check warning.
1317
- - Always show token cost in the report.
1318
- - Never hide cohesion scores behind symbols - show the raw number.
1319
- - Never run HTML viz on a graph with more than 5,000 nodes without warning the user.