okstra 0.130.3 → 0.131.0

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