okstra 0.108.0 → 0.109.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 (642) hide show
  1. package/package.json +1 -1
  2. package/runtime/BUILD.json +2 -2
  3. package/runtime/prompts/profiles/_common-contract.md +1 -1
  4. package/runtime/python/okstra_ctl/graphify_cmd.py +225 -0
  5. package/runtime/python/okstra_ctl/resolve_task_key.py +15 -9
  6. package/runtime/python/okstra_project/__init__.py +2 -0
  7. package/runtime/python/okstra_project/state.py +36 -0
  8. package/runtime/python/okstra_vendor/__init__.py +41 -0
  9. package/runtime/python/okstra_vendor/graphify/.vendored-version +1 -0
  10. package/runtime/python/okstra_vendor/graphify/__init__.py +28 -0
  11. package/runtime/python/okstra_vendor/graphify/__main__.py +1371 -0
  12. package/runtime/python/okstra_vendor/graphify/analyze.py +540 -0
  13. package/runtime/python/okstra_vendor/graphify/benchmark.py +129 -0
  14. package/runtime/python/okstra_vendor/graphify/build.py +107 -0
  15. package/runtime/python/okstra_vendor/graphify/cache.py +169 -0
  16. package/runtime/python/okstra_vendor/graphify/cluster.py +137 -0
  17. package/runtime/python/okstra_vendor/graphify/detect.py +510 -0
  18. package/runtime/python/okstra_vendor/graphify/export.py +1014 -0
  19. package/runtime/python/okstra_vendor/graphify/extract.py +3277 -0
  20. package/runtime/python/okstra_vendor/graphify/hooks.py +220 -0
  21. package/runtime/python/okstra_vendor/graphify/ingest.py +297 -0
  22. package/runtime/python/okstra_vendor/graphify/manifest.py +4 -0
  23. package/runtime/python/okstra_vendor/graphify/report.py +175 -0
  24. package/runtime/python/okstra_vendor/graphify/security.py +203 -0
  25. package/runtime/python/okstra_vendor/graphify/serve.py +373 -0
  26. package/runtime/python/okstra_vendor/graphify/skill-aider.md +1184 -0
  27. package/runtime/python/okstra_vendor/graphify/skill-claw.md +1184 -0
  28. package/runtime/python/okstra_vendor/graphify/skill-codex.md +1242 -0
  29. package/runtime/python/okstra_vendor/graphify/skill-copilot.md +1268 -0
  30. package/runtime/python/okstra_vendor/graphify/skill-droid.md +1239 -0
  31. package/runtime/python/okstra_vendor/graphify/skill-kiro.md +1183 -0
  32. package/runtime/python/okstra_vendor/graphify/skill-opencode.md +1238 -0
  33. package/runtime/python/okstra_vendor/graphify/skill-trae.md +1208 -0
  34. package/runtime/python/okstra_vendor/graphify/skill-vscode.md +253 -0
  35. package/runtime/python/okstra_vendor/graphify/skill-windows.md +1245 -0
  36. package/runtime/python/okstra_vendor/graphify/skill.md +1319 -0
  37. package/runtime/python/okstra_vendor/graphify/transcribe.py +182 -0
  38. package/runtime/python/okstra_vendor/graphify/validate.py +72 -0
  39. package/runtime/python/okstra_vendor/graphify/watch.py +188 -0
  40. package/runtime/python/okstra_vendor/graphify/wiki.py +214 -0
  41. package/runtime/python/okstra_vendor/networkx/__init__.py +62 -0
  42. package/runtime/python/okstra_vendor/networkx/algorithms/__init__.py +134 -0
  43. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/__init__.py +26 -0
  44. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/clique.py +259 -0
  45. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/clustering_coefficient.py +71 -0
  46. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/connectivity.py +412 -0
  47. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/density.py +396 -0
  48. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/distance_measures.py +150 -0
  49. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/dominating_set.py +149 -0
  50. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/kcomponents.py +369 -0
  51. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/matching.py +44 -0
  52. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/maxcut.py +143 -0
  53. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/ramsey.py +53 -0
  54. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/steinertree.py +265 -0
  55. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/__init__.py +0 -0
  56. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_approx_clust_coeff.py +41 -0
  57. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_clique.py +112 -0
  58. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_connectivity.py +199 -0
  59. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_density.py +146 -0
  60. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_distance_measures.py +59 -0
  61. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_dominating_set.py +78 -0
  62. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_kcomponents.py +303 -0
  63. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_matching.py +8 -0
  64. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_maxcut.py +94 -0
  65. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_ramsey.py +31 -0
  66. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_steinertree.py +306 -0
  67. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_traveling_salesman.py +1014 -0
  68. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_treewidth.py +274 -0
  69. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_vertex_cover.py +68 -0
  70. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/traveling_salesman.py +1508 -0
  71. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/treewidth.py +255 -0
  72. package/runtime/python/okstra_vendor/networkx/algorithms/approximation/vertex_cover.py +83 -0
  73. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/__init__.py +5 -0
  74. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/connectivity.py +122 -0
  75. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/correlation.py +302 -0
  76. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/mixing.py +255 -0
  77. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/neighbor_degree.py +160 -0
  78. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/pairs.py +127 -0
  79. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/tests/__init__.py +0 -0
  80. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/tests/base_test.py +81 -0
  81. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/tests/test_connectivity.py +143 -0
  82. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/tests/test_correlation.py +122 -0
  83. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/tests/test_mixing.py +174 -0
  84. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/tests/test_neighbor_degree.py +107 -0
  85. package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/tests/test_pairs.py +87 -0
  86. package/runtime/python/okstra_vendor/networkx/algorithms/asteroidal.py +164 -0
  87. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/__init__.py +88 -0
  88. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/basic.py +322 -0
  89. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/centrality.py +290 -0
  90. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/cluster.py +289 -0
  91. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/covering.py +57 -0
  92. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/edgelist.py +360 -0
  93. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/extendability.py +105 -0
  94. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/generators.py +603 -0
  95. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/link_analysis.py +316 -0
  96. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/matching.py +590 -0
  97. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/matrix.py +232 -0
  98. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/projection.py +526 -0
  99. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/redundancy.py +112 -0
  100. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/spectral.py +69 -0
  101. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/__init__.py +0 -0
  102. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_basic.py +125 -0
  103. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_centrality.py +192 -0
  104. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_cluster.py +84 -0
  105. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_covering.py +33 -0
  106. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_edgelist.py +240 -0
  107. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_extendability.py +334 -0
  108. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_generators.py +407 -0
  109. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_link_analysis.py +218 -0
  110. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_matching.py +327 -0
  111. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_matrix.py +138 -0
  112. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_project.py +409 -0
  113. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_redundancy.py +35 -0
  114. package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_spectral_bipartivity.py +80 -0
  115. package/runtime/python/okstra_vendor/networkx/algorithms/boundary.py +168 -0
  116. package/runtime/python/okstra_vendor/networkx/algorithms/bridges.py +205 -0
  117. package/runtime/python/okstra_vendor/networkx/algorithms/broadcasting.py +164 -0
  118. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/__init__.py +20 -0
  119. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/betweenness.py +591 -0
  120. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/betweenness_subset.py +236 -0
  121. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/closeness.py +282 -0
  122. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_betweenness.py +364 -0
  123. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_betweenness_subset.py +227 -0
  124. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_closeness.py +96 -0
  125. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/degree_alg.py +150 -0
  126. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/dispersion.py +107 -0
  127. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/eigenvector.py +357 -0
  128. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/flow_matrix.py +130 -0
  129. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/group.py +787 -0
  130. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/harmonic.py +88 -0
  131. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/katz.py +331 -0
  132. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/laplacian.py +150 -0
  133. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/load.py +200 -0
  134. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/percolation.py +128 -0
  135. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/reaching.py +209 -0
  136. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/second_order.py +141 -0
  137. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/subgraph_alg.py +361 -0
  138. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/__init__.py +0 -0
  139. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_betweenness_centrality.py +923 -0
  140. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_betweenness_centrality_subset.py +354 -0
  141. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_closeness_centrality.py +274 -0
  142. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality.py +259 -0
  143. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality_subset.py +147 -0
  144. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_current_flow_closeness.py +43 -0
  145. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_degree_centrality.py +144 -0
  146. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_dispersion.py +73 -0
  147. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_eigenvector_centrality.py +186 -0
  148. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_group.py +277 -0
  149. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_harmonic_centrality.py +122 -0
  150. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_katz_centrality.py +345 -0
  151. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_laplacian_centrality.py +220 -0
  152. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_load_centrality.py +344 -0
  153. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_percolation_centrality.py +87 -0
  154. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_reaching.py +140 -0
  155. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_second_order_centrality.py +82 -0
  156. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_subgraph.py +110 -0
  157. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_trophic.py +302 -0
  158. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_voterank.py +64 -0
  159. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/trophic.py +181 -0
  160. package/runtime/python/okstra_vendor/networkx/algorithms/centrality/voterank_alg.py +95 -0
  161. package/runtime/python/okstra_vendor/networkx/algorithms/chains.py +172 -0
  162. package/runtime/python/okstra_vendor/networkx/algorithms/chordal.py +443 -0
  163. package/runtime/python/okstra_vendor/networkx/algorithms/clique.py +818 -0
  164. package/runtime/python/okstra_vendor/networkx/algorithms/cluster.py +732 -0
  165. package/runtime/python/okstra_vendor/networkx/algorithms/coloring/__init__.py +4 -0
  166. package/runtime/python/okstra_vendor/networkx/algorithms/coloring/equitable_coloring.py +505 -0
  167. package/runtime/python/okstra_vendor/networkx/algorithms/coloring/greedy_coloring.py +565 -0
  168. package/runtime/python/okstra_vendor/networkx/algorithms/coloring/tests/__init__.py +0 -0
  169. package/runtime/python/okstra_vendor/networkx/algorithms/coloring/tests/test_coloring.py +863 -0
  170. package/runtime/python/okstra_vendor/networkx/algorithms/communicability_alg.py +163 -0
  171. package/runtime/python/okstra_vendor/networkx/algorithms/community/__init__.py +28 -0
  172. package/runtime/python/okstra_vendor/networkx/algorithms/community/asyn_fluid.py +153 -0
  173. package/runtime/python/okstra_vendor/networkx/algorithms/community/bipartitions.py +354 -0
  174. package/runtime/python/okstra_vendor/networkx/algorithms/community/centrality.py +171 -0
  175. package/runtime/python/okstra_vendor/networkx/algorithms/community/community_utils.py +30 -0
  176. package/runtime/python/okstra_vendor/networkx/algorithms/community/divisive.py +216 -0
  177. package/runtime/python/okstra_vendor/networkx/algorithms/community/kclique.py +79 -0
  178. package/runtime/python/okstra_vendor/networkx/algorithms/community/label_propagation.py +338 -0
  179. package/runtime/python/okstra_vendor/networkx/algorithms/community/leiden.py +162 -0
  180. package/runtime/python/okstra_vendor/networkx/algorithms/community/local.py +220 -0
  181. package/runtime/python/okstra_vendor/networkx/algorithms/community/louvain.py +384 -0
  182. package/runtime/python/okstra_vendor/networkx/algorithms/community/lukes.py +227 -0
  183. package/runtime/python/okstra_vendor/networkx/algorithms/community/modularity_max.py +452 -0
  184. package/runtime/python/okstra_vendor/networkx/algorithms/community/quality.py +347 -0
  185. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/__init__.py +0 -0
  186. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_asyn_fluid.py +147 -0
  187. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_bipartitions.py +157 -0
  188. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_centrality.py +85 -0
  189. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_divisive.py +106 -0
  190. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_kclique.py +91 -0
  191. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_label_propagation.py +241 -0
  192. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_leiden.py +138 -0
  193. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_local.py +76 -0
  194. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_louvain.py +264 -0
  195. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_lukes.py +152 -0
  196. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_modularity_max.py +340 -0
  197. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_quality.py +139 -0
  198. package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_utils.py +26 -0
  199. package/runtime/python/okstra_vendor/networkx/algorithms/components/__init__.py +6 -0
  200. package/runtime/python/okstra_vendor/networkx/algorithms/components/attracting.py +115 -0
  201. package/runtime/python/okstra_vendor/networkx/algorithms/components/biconnected.py +394 -0
  202. package/runtime/python/okstra_vendor/networkx/algorithms/components/connected.py +282 -0
  203. package/runtime/python/okstra_vendor/networkx/algorithms/components/semiconnected.py +71 -0
  204. package/runtime/python/okstra_vendor/networkx/algorithms/components/strongly_connected.py +359 -0
  205. package/runtime/python/okstra_vendor/networkx/algorithms/components/tests/__init__.py +0 -0
  206. package/runtime/python/okstra_vendor/networkx/algorithms/components/tests/test_attracting.py +70 -0
  207. package/runtime/python/okstra_vendor/networkx/algorithms/components/tests/test_biconnected.py +248 -0
  208. package/runtime/python/okstra_vendor/networkx/algorithms/components/tests/test_connected.py +138 -0
  209. package/runtime/python/okstra_vendor/networkx/algorithms/components/tests/test_semiconnected.py +55 -0
  210. package/runtime/python/okstra_vendor/networkx/algorithms/components/tests/test_strongly_connected.py +193 -0
  211. package/runtime/python/okstra_vendor/networkx/algorithms/components/tests/test_weakly_connected.py +96 -0
  212. package/runtime/python/okstra_vendor/networkx/algorithms/components/weakly_connected.py +196 -0
  213. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/__init__.py +11 -0
  214. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/connectivity.py +811 -0
  215. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/cuts.py +616 -0
  216. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/disjoint_paths.py +408 -0
  217. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/edge_augmentation.py +1270 -0
  218. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/edge_kcomponents.py +592 -0
  219. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/kcomponents.py +220 -0
  220. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/kcutsets.py +235 -0
  221. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/stoerwagner.py +152 -0
  222. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/__init__.py +0 -0
  223. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/test_connectivity.py +421 -0
  224. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/test_cuts.py +309 -0
  225. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/test_disjoint_paths.py +249 -0
  226. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/test_edge_augmentation.py +502 -0
  227. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/test_edge_kcomponents.py +488 -0
  228. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/test_kcomponents.py +323 -0
  229. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/test_kcutsets.py +280 -0
  230. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/test_stoer_wagner.py +102 -0
  231. package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/utils.py +88 -0
  232. package/runtime/python/okstra_vendor/networkx/algorithms/core.py +588 -0
  233. package/runtime/python/okstra_vendor/networkx/algorithms/covering.py +142 -0
  234. package/runtime/python/okstra_vendor/networkx/algorithms/cuts.py +416 -0
  235. package/runtime/python/okstra_vendor/networkx/algorithms/cycles.py +1234 -0
  236. package/runtime/python/okstra_vendor/networkx/algorithms/d_separation.py +677 -0
  237. package/runtime/python/okstra_vendor/networkx/algorithms/dag.py +1392 -0
  238. package/runtime/python/okstra_vendor/networkx/algorithms/distance_measures.py +1095 -0
  239. package/runtime/python/okstra_vendor/networkx/algorithms/distance_regular.py +272 -0
  240. package/runtime/python/okstra_vendor/networkx/algorithms/dominance.py +142 -0
  241. package/runtime/python/okstra_vendor/networkx/algorithms/dominating.py +268 -0
  242. package/runtime/python/okstra_vendor/networkx/algorithms/efficiency_measures.py +167 -0
  243. package/runtime/python/okstra_vendor/networkx/algorithms/euler.py +470 -0
  244. package/runtime/python/okstra_vendor/networkx/algorithms/flow/__init__.py +11 -0
  245. package/runtime/python/okstra_vendor/networkx/algorithms/flow/boykovkolmogorov.py +370 -0
  246. package/runtime/python/okstra_vendor/networkx/algorithms/flow/capacityscaling.py +407 -0
  247. package/runtime/python/okstra_vendor/networkx/algorithms/flow/dinitz_alg.py +238 -0
  248. package/runtime/python/okstra_vendor/networkx/algorithms/flow/edmondskarp.py +241 -0
  249. package/runtime/python/okstra_vendor/networkx/algorithms/flow/gomory_hu.py +178 -0
  250. package/runtime/python/okstra_vendor/networkx/algorithms/flow/maxflow.py +611 -0
  251. package/runtime/python/okstra_vendor/networkx/algorithms/flow/mincost.py +356 -0
  252. package/runtime/python/okstra_vendor/networkx/algorithms/flow/networksimplex.py +662 -0
  253. package/runtime/python/okstra_vendor/networkx/algorithms/flow/preflowpush.py +425 -0
  254. package/runtime/python/okstra_vendor/networkx/algorithms/flow/shortestaugmentingpath.py +300 -0
  255. package/runtime/python/okstra_vendor/networkx/algorithms/flow/tests/__init__.py +0 -0
  256. package/runtime/python/okstra_vendor/networkx/algorithms/flow/tests/gl1.gpickle.bz2 +0 -0
  257. package/runtime/python/okstra_vendor/networkx/algorithms/flow/tests/gw1.gpickle.bz2 +0 -0
  258. package/runtime/python/okstra_vendor/networkx/algorithms/flow/tests/netgen-2.gpickle.bz2 +0 -0
  259. package/runtime/python/okstra_vendor/networkx/algorithms/flow/tests/test_gomory_hu.py +128 -0
  260. package/runtime/python/okstra_vendor/networkx/algorithms/flow/tests/test_maxflow.py +573 -0
  261. package/runtime/python/okstra_vendor/networkx/algorithms/flow/tests/test_maxflow_large_graph.py +155 -0
  262. package/runtime/python/okstra_vendor/networkx/algorithms/flow/tests/test_mincost.py +475 -0
  263. package/runtime/python/okstra_vendor/networkx/algorithms/flow/tests/test_networksimplex.py +481 -0
  264. package/runtime/python/okstra_vendor/networkx/algorithms/flow/tests/wlm3.gpickle.bz2 +0 -0
  265. package/runtime/python/okstra_vendor/networkx/algorithms/flow/utils.py +194 -0
  266. package/runtime/python/okstra_vendor/networkx/algorithms/graph_hashing.py +435 -0
  267. package/runtime/python/okstra_vendor/networkx/algorithms/graphical.py +483 -0
  268. package/runtime/python/okstra_vendor/networkx/algorithms/hierarchy.py +57 -0
  269. package/runtime/python/okstra_vendor/networkx/algorithms/hybrid.py +196 -0
  270. package/runtime/python/okstra_vendor/networkx/algorithms/isolate.py +107 -0
  271. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/__init__.py +7 -0
  272. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/ismags.py +1306 -0
  273. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/isomorph.py +336 -0
  274. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/isomorphvf2.py +1262 -0
  275. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/matchhelpers.py +352 -0
  276. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/temporalisomorphvf2.py +308 -0
  277. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/__init__.py +0 -0
  278. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/iso_r01_s80.A99 +0 -0
  279. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/iso_r01_s80.B99 +0 -0
  280. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/si2_b06_m200.A99 +0 -0
  281. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/si2_b06_m200.B99 +0 -0
  282. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/test_ismags.py +719 -0
  283. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/test_isomorphism.py +103 -0
  284. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/test_isomorphvf2.py +490 -0
  285. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/test_match_helpers.py +64 -0
  286. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/test_temporalisomorphvf2.py +212 -0
  287. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/test_tree_isomorphism.py +202 -0
  288. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/test_vf2pp.py +1655 -0
  289. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/test_vf2pp_helpers.py +3118 -0
  290. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tests/test_vf2userfunc.py +196 -0
  291. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tree_isomorphism.py +264 -0
  292. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/vf2pp.py +1102 -0
  293. package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/vf2userfunc.py +192 -0
  294. package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/__init__.py +2 -0
  295. package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/hits_alg.py +337 -0
  296. package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/pagerank_alg.py +498 -0
  297. package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/tests/__init__.py +0 -0
  298. package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/tests/test_hits.py +77 -0
  299. package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/tests/test_pagerank.py +213 -0
  300. package/runtime/python/okstra_vendor/networkx/algorithms/link_prediction.py +687 -0
  301. package/runtime/python/okstra_vendor/networkx/algorithms/lowest_common_ancestors.py +280 -0
  302. package/runtime/python/okstra_vendor/networkx/algorithms/matching.py +1148 -0
  303. package/runtime/python/okstra_vendor/networkx/algorithms/minors/__init__.py +27 -0
  304. package/runtime/python/okstra_vendor/networkx/algorithms/minors/contraction.py +738 -0
  305. package/runtime/python/okstra_vendor/networkx/algorithms/minors/tests/test_contraction.py +544 -0
  306. package/runtime/python/okstra_vendor/networkx/algorithms/mis.py +78 -0
  307. package/runtime/python/okstra_vendor/networkx/algorithms/moral.py +59 -0
  308. package/runtime/python/okstra_vendor/networkx/algorithms/node_classification.py +219 -0
  309. package/runtime/python/okstra_vendor/networkx/algorithms/non_randomness.py +155 -0
  310. package/runtime/python/okstra_vendor/networkx/algorithms/operators/__init__.py +4 -0
  311. package/runtime/python/okstra_vendor/networkx/algorithms/operators/all.py +324 -0
  312. package/runtime/python/okstra_vendor/networkx/algorithms/operators/binary.py +468 -0
  313. package/runtime/python/okstra_vendor/networkx/algorithms/operators/product.py +633 -0
  314. package/runtime/python/okstra_vendor/networkx/algorithms/operators/tests/__init__.py +0 -0
  315. package/runtime/python/okstra_vendor/networkx/algorithms/operators/tests/test_all.py +328 -0
  316. package/runtime/python/okstra_vendor/networkx/algorithms/operators/tests/test_binary.py +451 -0
  317. package/runtime/python/okstra_vendor/networkx/algorithms/operators/tests/test_product.py +491 -0
  318. package/runtime/python/okstra_vendor/networkx/algorithms/operators/tests/test_unary.py +55 -0
  319. package/runtime/python/okstra_vendor/networkx/algorithms/operators/unary.py +77 -0
  320. package/runtime/python/okstra_vendor/networkx/algorithms/perfect_graph.py +73 -0
  321. package/runtime/python/okstra_vendor/networkx/algorithms/planar_drawing.py +464 -0
  322. package/runtime/python/okstra_vendor/networkx/algorithms/planarity.py +1463 -0
  323. package/runtime/python/okstra_vendor/networkx/algorithms/polynomials.py +306 -0
  324. package/runtime/python/okstra_vendor/networkx/algorithms/reciprocity.py +98 -0
  325. package/runtime/python/okstra_vendor/networkx/algorithms/regular.py +167 -0
  326. package/runtime/python/okstra_vendor/networkx/algorithms/richclub.py +138 -0
  327. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/__init__.py +5 -0
  328. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/astar.py +239 -0
  329. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/dense.py +264 -0
  330. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/generic.py +716 -0
  331. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/tests/__init__.py +0 -0
  332. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/tests/test_astar.py +254 -0
  333. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/tests/test_dense.py +212 -0
  334. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/tests/test_dense_numpy.py +88 -0
  335. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/tests/test_generic.py +511 -0
  336. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/tests/test_unweighted.py +149 -0
  337. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/tests/test_weighted.py +983 -0
  338. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/unweighted.py +625 -0
  339. package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/weighted.py +2542 -0
  340. package/runtime/python/okstra_vendor/networkx/algorithms/similarity.py +2107 -0
  341. package/runtime/python/okstra_vendor/networkx/algorithms/simple_paths.py +966 -0
  342. package/runtime/python/okstra_vendor/networkx/algorithms/smallworld.py +404 -0
  343. package/runtime/python/okstra_vendor/networkx/algorithms/smetric.py +30 -0
  344. package/runtime/python/okstra_vendor/networkx/algorithms/sparsifiers.py +296 -0
  345. package/runtime/python/okstra_vendor/networkx/algorithms/structuralholes.py +374 -0
  346. package/runtime/python/okstra_vendor/networkx/algorithms/summarization.py +564 -0
  347. package/runtime/python/okstra_vendor/networkx/algorithms/swap.py +406 -0
  348. package/runtime/python/okstra_vendor/networkx/algorithms/tests/__init__.py +0 -0
  349. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_asteroidal.py +23 -0
  350. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_boundary.py +154 -0
  351. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_bridges.py +144 -0
  352. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_broadcasting.py +109 -0
  353. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_chains.py +136 -0
  354. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_chordal.py +129 -0
  355. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_clique.py +300 -0
  356. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_cluster.py +678 -0
  357. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_communicability.py +80 -0
  358. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_core.py +266 -0
  359. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_covering.py +85 -0
  360. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_cuts.py +171 -0
  361. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_cycles.py +984 -0
  362. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_d_separation.py +340 -0
  363. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_dag.py +835 -0
  364. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_distance_measures.py +831 -0
  365. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_distance_regular.py +85 -0
  366. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_dominance.py +299 -0
  367. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_dominating.py +115 -0
  368. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_efficiency.py +58 -0
  369. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_euler.py +314 -0
  370. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_graph_hashing.py +872 -0
  371. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_graphical.py +163 -0
  372. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_hierarchy.py +46 -0
  373. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_hybrid.py +24 -0
  374. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_isolate.py +26 -0
  375. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_link_prediction.py +615 -0
  376. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_lowest_common_ancestors.py +459 -0
  377. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_matching.py +556 -0
  378. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_max_weight_clique.py +179 -0
  379. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_mis.py +62 -0
  380. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_moral.py +15 -0
  381. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_node_classification.py +140 -0
  382. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_non_randomness.py +60 -0
  383. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_perfect_graph.py +27 -0
  384. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_planar_drawing.py +274 -0
  385. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_planarity.py +556 -0
  386. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_polynomials.py +57 -0
  387. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_reciprocity.py +37 -0
  388. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_regular.py +88 -0
  389. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_richclub.py +149 -0
  390. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_similarity.py +1158 -0
  391. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_simple_paths.py +803 -0
  392. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_smallworld.py +76 -0
  393. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_smetric.py +8 -0
  394. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_sparsifiers.py +138 -0
  395. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_structuralholes.py +191 -0
  396. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_summarization.py +642 -0
  397. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_swap.py +179 -0
  398. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_threshold.py +270 -0
  399. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_time_dependent.py +431 -0
  400. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_tournament.py +161 -0
  401. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_triads.py +248 -0
  402. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_vitality.py +41 -0
  403. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_voronoi.py +103 -0
  404. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_walks.py +54 -0
  405. package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_wiener.py +157 -0
  406. package/runtime/python/okstra_vendor/networkx/algorithms/threshold.py +981 -0
  407. package/runtime/python/okstra_vendor/networkx/algorithms/time_dependent.py +142 -0
  408. package/runtime/python/okstra_vendor/networkx/algorithms/tournament.py +406 -0
  409. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/__init__.py +5 -0
  410. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/beamsearch.py +90 -0
  411. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/breadth_first_search.py +576 -0
  412. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/depth_first_search.py +529 -0
  413. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/edgebfs.py +185 -0
  414. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/edgedfs.py +182 -0
  415. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/tests/__init__.py +0 -0
  416. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/tests/test_beamsearch.py +25 -0
  417. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/tests/test_bfs.py +203 -0
  418. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/tests/test_dfs.py +307 -0
  419. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/tests/test_edgebfs.py +147 -0
  420. package/runtime/python/okstra_vendor/networkx/algorithms/traversal/tests/test_edgedfs.py +131 -0
  421. package/runtime/python/okstra_vendor/networkx/algorithms/tree/__init__.py +7 -0
  422. package/runtime/python/okstra_vendor/networkx/algorithms/tree/branchings.py +1042 -0
  423. package/runtime/python/okstra_vendor/networkx/algorithms/tree/coding.py +413 -0
  424. package/runtime/python/okstra_vendor/networkx/algorithms/tree/decomposition.py +88 -0
  425. package/runtime/python/okstra_vendor/networkx/algorithms/tree/distance_measures.py +219 -0
  426. package/runtime/python/okstra_vendor/networkx/algorithms/tree/mst.py +1281 -0
  427. package/runtime/python/okstra_vendor/networkx/algorithms/tree/operations.py +106 -0
  428. package/runtime/python/okstra_vendor/networkx/algorithms/tree/recognition.py +273 -0
  429. package/runtime/python/okstra_vendor/networkx/algorithms/tree/tests/__init__.py +0 -0
  430. package/runtime/python/okstra_vendor/networkx/algorithms/tree/tests/test_branchings.py +624 -0
  431. package/runtime/python/okstra_vendor/networkx/algorithms/tree/tests/test_coding.py +114 -0
  432. package/runtime/python/okstra_vendor/networkx/algorithms/tree/tests/test_decomposition.py +79 -0
  433. package/runtime/python/okstra_vendor/networkx/algorithms/tree/tests/test_distance_measures.py +99 -0
  434. package/runtime/python/okstra_vendor/networkx/algorithms/tree/tests/test_mst.py +934 -0
  435. package/runtime/python/okstra_vendor/networkx/algorithms/tree/tests/test_operations.py +53 -0
  436. package/runtime/python/okstra_vendor/networkx/algorithms/tree/tests/test_recognition.py +174 -0
  437. package/runtime/python/okstra_vendor/networkx/algorithms/triads.py +500 -0
  438. package/runtime/python/okstra_vendor/networkx/algorithms/vitality.py +76 -0
  439. package/runtime/python/okstra_vendor/networkx/algorithms/voronoi.py +86 -0
  440. package/runtime/python/okstra_vendor/networkx/algorithms/walks.py +77 -0
  441. package/runtime/python/okstra_vendor/networkx/algorithms/wiener.py +278 -0
  442. package/runtime/python/okstra_vendor/networkx/classes/__init__.py +13 -0
  443. package/runtime/python/okstra_vendor/networkx/classes/coreviews.py +435 -0
  444. package/runtime/python/okstra_vendor/networkx/classes/digraph.py +1363 -0
  445. package/runtime/python/okstra_vendor/networkx/classes/filters.py +95 -0
  446. package/runtime/python/okstra_vendor/networkx/classes/function.py +1549 -0
  447. package/runtime/python/okstra_vendor/networkx/classes/graph.py +2082 -0
  448. package/runtime/python/okstra_vendor/networkx/classes/graphviews.py +269 -0
  449. package/runtime/python/okstra_vendor/networkx/classes/multidigraph.py +977 -0
  450. package/runtime/python/okstra_vendor/networkx/classes/multigraph.py +1294 -0
  451. package/runtime/python/okstra_vendor/networkx/classes/reportviews.py +1447 -0
  452. package/runtime/python/okstra_vendor/networkx/classes/tests/__init__.py +0 -0
  453. package/runtime/python/okstra_vendor/networkx/classes/tests/dispatch_interface.py +192 -0
  454. package/runtime/python/okstra_vendor/networkx/classes/tests/historical_tests.py +476 -0
  455. package/runtime/python/okstra_vendor/networkx/classes/tests/test_coreviews.py +362 -0
  456. package/runtime/python/okstra_vendor/networkx/classes/tests/test_digraph.py +331 -0
  457. package/runtime/python/okstra_vendor/networkx/classes/tests/test_digraph_historical.py +110 -0
  458. package/runtime/python/okstra_vendor/networkx/classes/tests/test_filters.py +177 -0
  459. package/runtime/python/okstra_vendor/networkx/classes/tests/test_function.py +1045 -0
  460. package/runtime/python/okstra_vendor/networkx/classes/tests/test_graph.py +950 -0
  461. package/runtime/python/okstra_vendor/networkx/classes/tests/test_graph_historical.py +12 -0
  462. package/runtime/python/okstra_vendor/networkx/classes/tests/test_graphviews.py +349 -0
  463. package/runtime/python/okstra_vendor/networkx/classes/tests/test_multidigraph.py +459 -0
  464. package/runtime/python/okstra_vendor/networkx/classes/tests/test_multigraph.py +528 -0
  465. package/runtime/python/okstra_vendor/networkx/classes/tests/test_reportviews.py +1421 -0
  466. package/runtime/python/okstra_vendor/networkx/classes/tests/test_special.py +131 -0
  467. package/runtime/python/okstra_vendor/networkx/classes/tests/test_subgraphviews.py +371 -0
  468. package/runtime/python/okstra_vendor/networkx/conftest.py +261 -0
  469. package/runtime/python/okstra_vendor/networkx/convert.py +502 -0
  470. package/runtime/python/okstra_vendor/networkx/convert_matrix.py +1314 -0
  471. package/runtime/python/okstra_vendor/networkx/drawing/__init__.py +7 -0
  472. package/runtime/python/okstra_vendor/networkx/drawing/layout.py +2036 -0
  473. package/runtime/python/okstra_vendor/networkx/drawing/nx_agraph.py +470 -0
  474. package/runtime/python/okstra_vendor/networkx/drawing/nx_latex.py +570 -0
  475. package/runtime/python/okstra_vendor/networkx/drawing/nx_pydot.py +361 -0
  476. package/runtime/python/okstra_vendor/networkx/drawing/nx_pylab.py +2978 -0
  477. package/runtime/python/okstra_vendor/networkx/drawing/tests/__init__.py +0 -0
  478. package/runtime/python/okstra_vendor/networkx/drawing/tests/baseline/test_display_complex.png +0 -0
  479. package/runtime/python/okstra_vendor/networkx/drawing/tests/baseline/test_display_empty_graph.png +0 -0
  480. package/runtime/python/okstra_vendor/networkx/drawing/tests/baseline/test_display_house_with_colors.png +0 -0
  481. package/runtime/python/okstra_vendor/networkx/drawing/tests/baseline/test_display_labels_and_colors.png +0 -0
  482. package/runtime/python/okstra_vendor/networkx/drawing/tests/baseline/test_display_shortest_path.png +0 -0
  483. package/runtime/python/okstra_vendor/networkx/drawing/tests/baseline/test_house_with_colors.png +0 -0
  484. package/runtime/python/okstra_vendor/networkx/drawing/tests/test_agraph.py +237 -0
  485. package/runtime/python/okstra_vendor/networkx/drawing/tests/test_image_comparison_pylab_mpl.py +229 -0
  486. package/runtime/python/okstra_vendor/networkx/drawing/tests/test_latex.py +285 -0
  487. package/runtime/python/okstra_vendor/networkx/drawing/tests/test_layout.py +631 -0
  488. package/runtime/python/okstra_vendor/networkx/drawing/tests/test_pydot.py +146 -0
  489. package/runtime/python/okstra_vendor/networkx/drawing/tests/test_pylab.py +1582 -0
  490. package/runtime/python/okstra_vendor/networkx/exception.py +131 -0
  491. package/runtime/python/okstra_vendor/networkx/generators/__init__.py +34 -0
  492. package/runtime/python/okstra_vendor/networkx/generators/atlas.dat.gz +0 -0
  493. package/runtime/python/okstra_vendor/networkx/generators/atlas.py +227 -0
  494. package/runtime/python/okstra_vendor/networkx/generators/classic.py +1091 -0
  495. package/runtime/python/okstra_vendor/networkx/generators/cographs.py +68 -0
  496. package/runtime/python/okstra_vendor/networkx/generators/community.py +1070 -0
  497. package/runtime/python/okstra_vendor/networkx/generators/degree_seq.py +886 -0
  498. package/runtime/python/okstra_vendor/networkx/generators/directed.py +572 -0
  499. package/runtime/python/okstra_vendor/networkx/generators/duplication.py +174 -0
  500. package/runtime/python/okstra_vendor/networkx/generators/ego.py +66 -0
  501. package/runtime/python/okstra_vendor/networkx/generators/expanders.py +499 -0
  502. package/runtime/python/okstra_vendor/networkx/generators/geometric.py +1037 -0
  503. package/runtime/python/okstra_vendor/networkx/generators/harary_graph.py +163 -0
  504. package/runtime/python/okstra_vendor/networkx/generators/internet_as_graphs.py +443 -0
  505. package/runtime/python/okstra_vendor/networkx/generators/intersection.py +125 -0
  506. package/runtime/python/okstra_vendor/networkx/generators/interval_graph.py +70 -0
  507. package/runtime/python/okstra_vendor/networkx/generators/joint_degree_seq.py +664 -0
  508. package/runtime/python/okstra_vendor/networkx/generators/lattice.py +405 -0
  509. package/runtime/python/okstra_vendor/networkx/generators/line.py +501 -0
  510. package/runtime/python/okstra_vendor/networkx/generators/mycielski.py +110 -0
  511. package/runtime/python/okstra_vendor/networkx/generators/nonisomorphic_trees.py +259 -0
  512. package/runtime/python/okstra_vendor/networkx/generators/random_clustered.py +117 -0
  513. package/runtime/python/okstra_vendor/networkx/generators/random_graphs.py +1416 -0
  514. package/runtime/python/okstra_vendor/networkx/generators/small.py +1070 -0
  515. package/runtime/python/okstra_vendor/networkx/generators/social.py +554 -0
  516. package/runtime/python/okstra_vendor/networkx/generators/spectral_graph_forge.py +120 -0
  517. package/runtime/python/okstra_vendor/networkx/generators/stochastic.py +54 -0
  518. package/runtime/python/okstra_vendor/networkx/generators/sudoku.py +131 -0
  519. package/runtime/python/okstra_vendor/networkx/generators/tests/__init__.py +0 -0
  520. package/runtime/python/okstra_vendor/networkx/generators/tests/test_atlas.py +75 -0
  521. package/runtime/python/okstra_vendor/networkx/generators/tests/test_classic.py +642 -0
  522. package/runtime/python/okstra_vendor/networkx/generators/tests/test_cographs.py +20 -0
  523. package/runtime/python/okstra_vendor/networkx/generators/tests/test_community.py +362 -0
  524. package/runtime/python/okstra_vendor/networkx/generators/tests/test_degree_seq.py +224 -0
  525. package/runtime/python/okstra_vendor/networkx/generators/tests/test_directed.py +189 -0
  526. package/runtime/python/okstra_vendor/networkx/generators/tests/test_duplication.py +103 -0
  527. package/runtime/python/okstra_vendor/networkx/generators/tests/test_ego.py +39 -0
  528. package/runtime/python/okstra_vendor/networkx/generators/tests/test_expanders.py +182 -0
  529. package/runtime/python/okstra_vendor/networkx/generators/tests/test_geometric.py +488 -0
  530. package/runtime/python/okstra_vendor/networkx/generators/tests/test_harary_graph.py +133 -0
  531. package/runtime/python/okstra_vendor/networkx/generators/tests/test_internet_as_graphs.py +221 -0
  532. package/runtime/python/okstra_vendor/networkx/generators/tests/test_intersection.py +28 -0
  533. package/runtime/python/okstra_vendor/networkx/generators/tests/test_interval_graph.py +144 -0
  534. package/runtime/python/okstra_vendor/networkx/generators/tests/test_joint_degree_seq.py +125 -0
  535. package/runtime/python/okstra_vendor/networkx/generators/tests/test_lattice.py +264 -0
  536. package/runtime/python/okstra_vendor/networkx/generators/tests/test_line.py +316 -0
  537. package/runtime/python/okstra_vendor/networkx/generators/tests/test_mycielski.py +30 -0
  538. package/runtime/python/okstra_vendor/networkx/generators/tests/test_nonisomorphic_trees.py +82 -0
  539. package/runtime/python/okstra_vendor/networkx/generators/tests/test_random_clustered.py +33 -0
  540. package/runtime/python/okstra_vendor/networkx/generators/tests/test_random_graphs.py +495 -0
  541. package/runtime/python/okstra_vendor/networkx/generators/tests/test_small.py +220 -0
  542. package/runtime/python/okstra_vendor/networkx/generators/tests/test_spectral_graph_forge.py +49 -0
  543. package/runtime/python/okstra_vendor/networkx/generators/tests/test_stochastic.py +72 -0
  544. package/runtime/python/okstra_vendor/networkx/generators/tests/test_sudoku.py +92 -0
  545. package/runtime/python/okstra_vendor/networkx/generators/tests/test_time_series.py +64 -0
  546. package/runtime/python/okstra_vendor/networkx/generators/tests/test_trees.py +195 -0
  547. package/runtime/python/okstra_vendor/networkx/generators/tests/test_triads.py +15 -0
  548. package/runtime/python/okstra_vendor/networkx/generators/time_series.py +74 -0
  549. package/runtime/python/okstra_vendor/networkx/generators/trees.py +1070 -0
  550. package/runtime/python/okstra_vendor/networkx/generators/triads.py +94 -0
  551. package/runtime/python/okstra_vendor/networkx/lazy_imports.py +188 -0
  552. package/runtime/python/okstra_vendor/networkx/linalg/__init__.py +13 -0
  553. package/runtime/python/okstra_vendor/networkx/linalg/algebraicconnectivity.py +650 -0
  554. package/runtime/python/okstra_vendor/networkx/linalg/attrmatrix.py +466 -0
  555. package/runtime/python/okstra_vendor/networkx/linalg/bethehessianmatrix.py +77 -0
  556. package/runtime/python/okstra_vendor/networkx/linalg/graphmatrix.py +168 -0
  557. package/runtime/python/okstra_vendor/networkx/linalg/laplacianmatrix.py +512 -0
  558. package/runtime/python/okstra_vendor/networkx/linalg/modularitymatrix.py +166 -0
  559. package/runtime/python/okstra_vendor/networkx/linalg/spectrum.py +186 -0
  560. package/runtime/python/okstra_vendor/networkx/linalg/tests/__init__.py +0 -0
  561. package/runtime/python/okstra_vendor/networkx/linalg/tests/test_algebraic_connectivity.py +400 -0
  562. package/runtime/python/okstra_vendor/networkx/linalg/tests/test_attrmatrix.py +108 -0
  563. package/runtime/python/okstra_vendor/networkx/linalg/tests/test_bethehessian.py +40 -0
  564. package/runtime/python/okstra_vendor/networkx/linalg/tests/test_graphmatrix.py +275 -0
  565. package/runtime/python/okstra_vendor/networkx/linalg/tests/test_laplacian.py +334 -0
  566. package/runtime/python/okstra_vendor/networkx/linalg/tests/test_modularity.py +86 -0
  567. package/runtime/python/okstra_vendor/networkx/linalg/tests/test_spectrum.py +70 -0
  568. package/runtime/python/okstra_vendor/networkx/readwrite/__init__.py +17 -0
  569. package/runtime/python/okstra_vendor/networkx/readwrite/adjlist.py +330 -0
  570. package/runtime/python/okstra_vendor/networkx/readwrite/edgelist.py +489 -0
  571. package/runtime/python/okstra_vendor/networkx/readwrite/gexf.py +1084 -0
  572. package/runtime/python/okstra_vendor/networkx/readwrite/gml.py +879 -0
  573. package/runtime/python/okstra_vendor/networkx/readwrite/graph6.py +427 -0
  574. package/runtime/python/okstra_vendor/networkx/readwrite/graphml.py +1053 -0
  575. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/__init__.py +19 -0
  576. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/adjacency.py +156 -0
  577. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/cytoscape.py +190 -0
  578. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/node_link.py +261 -0
  579. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tests/__init__.py +0 -0
  580. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tests/test_adjacency.py +78 -0
  581. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tests/test_cytoscape.py +78 -0
  582. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tests/test_node_link.py +109 -0
  583. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tests/test_tree.py +48 -0
  584. package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tree.py +137 -0
  585. package/runtime/python/okstra_vendor/networkx/readwrite/leda.py +108 -0
  586. package/runtime/python/okstra_vendor/networkx/readwrite/multiline_adjlist.py +393 -0
  587. package/runtime/python/okstra_vendor/networkx/readwrite/p2g.py +113 -0
  588. package/runtime/python/okstra_vendor/networkx/readwrite/pajek.py +286 -0
  589. package/runtime/python/okstra_vendor/networkx/readwrite/sparse6.py +379 -0
  590. package/runtime/python/okstra_vendor/networkx/readwrite/tests/__init__.py +0 -0
  591. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_adjlist.py +354 -0
  592. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_edgelist.py +318 -0
  593. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_gexf.py +612 -0
  594. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_gml.py +744 -0
  595. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_graph6.py +181 -0
  596. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_graphml.py +1531 -0
  597. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_leda.py +30 -0
  598. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_p2g.py +63 -0
  599. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_pajek.py +128 -0
  600. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_sparse6.py +166 -0
  601. package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_text.py +1742 -0
  602. package/runtime/python/okstra_vendor/networkx/readwrite/text.py +851 -0
  603. package/runtime/python/okstra_vendor/networkx/relabel.py +285 -0
  604. package/runtime/python/okstra_vendor/networkx/tests/__init__.py +0 -0
  605. package/runtime/python/okstra_vendor/networkx/tests/test_all_random_functions.py +248 -0
  606. package/runtime/python/okstra_vendor/networkx/tests/test_convert.py +321 -0
  607. package/runtime/python/okstra_vendor/networkx/tests/test_convert_numpy.py +531 -0
  608. package/runtime/python/okstra_vendor/networkx/tests/test_convert_pandas.py +349 -0
  609. package/runtime/python/okstra_vendor/networkx/tests/test_convert_scipy.py +281 -0
  610. package/runtime/python/okstra_vendor/networkx/tests/test_exceptions.py +40 -0
  611. package/runtime/python/okstra_vendor/networkx/tests/test_import.py +11 -0
  612. package/runtime/python/okstra_vendor/networkx/tests/test_lazy_imports.py +96 -0
  613. package/runtime/python/okstra_vendor/networkx/tests/test_relabel.py +349 -0
  614. package/runtime/python/okstra_vendor/networkx/tests/test_removed_functions_exception_messages.py +8 -0
  615. package/runtime/python/okstra_vendor/networkx/utils/__init__.py +8 -0
  616. package/runtime/python/okstra_vendor/networkx/utils/backends.py +2171 -0
  617. package/runtime/python/okstra_vendor/networkx/utils/configs.py +396 -0
  618. package/runtime/python/okstra_vendor/networkx/utils/decorators.py +1233 -0
  619. package/runtime/python/okstra_vendor/networkx/utils/heaps.py +338 -0
  620. package/runtime/python/okstra_vendor/networkx/utils/mapped_queue.py +297 -0
  621. package/runtime/python/okstra_vendor/networkx/utils/misc.py +703 -0
  622. package/runtime/python/okstra_vendor/networkx/utils/random_sequence.py +198 -0
  623. package/runtime/python/okstra_vendor/networkx/utils/rcm.py +159 -0
  624. package/runtime/python/okstra_vendor/networkx/utils/tests/__init__.py +0 -0
  625. package/runtime/python/okstra_vendor/networkx/utils/tests/test__init.py +11 -0
  626. package/runtime/python/okstra_vendor/networkx/utils/tests/test_backends.py +225 -0
  627. package/runtime/python/okstra_vendor/networkx/utils/tests/test_config.py +263 -0
  628. package/runtime/python/okstra_vendor/networkx/utils/tests/test_decorators.py +510 -0
  629. package/runtime/python/okstra_vendor/networkx/utils/tests/test_heaps.py +131 -0
  630. package/runtime/python/okstra_vendor/networkx/utils/tests/test_mapped_queue.py +268 -0
  631. package/runtime/python/okstra_vendor/networkx/utils/tests/test_misc.py +393 -0
  632. package/runtime/python/okstra_vendor/networkx/utils/tests/test_random_sequence.py +53 -0
  633. package/runtime/python/okstra_vendor/networkx/utils/tests/test_rcm.py +63 -0
  634. package/runtime/python/okstra_vendor/networkx/utils/tests/test_unionfind.py +55 -0
  635. package/runtime/python/okstra_vendor/networkx/utils/union_find.py +106 -0
  636. package/runtime/skills/okstra-graphify/SKILL.md +161 -0
  637. package/runtime/skills/okstra-inspect/SKILL.md +17 -9
  638. package/runtime/templates/reports/settings.template.json +4 -0
  639. package/src/cli-registry.mjs +7 -0
  640. package/src/commands/graphify.mjs +32 -0
  641. package/src/commands/lifecycle/doctor.mjs +9 -0
  642. package/src/lib/skill-catalog.mjs +1 -0
@@ -0,0 +1,1238 @@
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
+ # Write interpreter path for all subsequent steps
73
+ mkdir -p graphify-out
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
+ **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.**
197
+
198
+ Before dispatching subagents, print a timing estimate:
199
+ - Load `total_words` and file counts from `.graphify_detect.json`
200
+ - Estimate agents needed: `ceil(uncached_non_code_files / 22)` (chunk size is 20-25)
201
+ - Estimate time: ~45s per agent batch (they run in parallel, so total ≈ 45s × ceil(agents/parallel_limit))
202
+ - Print: "Semantic extraction: ~N files → X agents, estimated ~Ys"
203
+
204
+ **Step B0 - Check extraction cache first**
205
+
206
+ Before dispatching any subagents, check which files already have cached extraction results:
207
+
208
+ ```bash
209
+ $(cat .graphify_python) -c "
210
+ import json
211
+ from graphify.cache import check_semantic_cache
212
+ from pathlib import Path
213
+
214
+ detect = json.loads(Path('.graphify_detect.json').read_text())
215
+ all_files = [f for files in detect['files'].values() for f in files]
216
+
217
+ cached_nodes, cached_edges, cached_hyperedges, uncached = check_semantic_cache(all_files)
218
+
219
+ if cached_nodes or cached_edges or cached_hyperedges:
220
+ Path('.graphify_cached.json').write_text(json.dumps({'nodes': cached_nodes, 'edges': cached_edges, 'hyperedges': cached_hyperedges}))
221
+ Path('.graphify_uncached.txt').write_text('\n'.join(uncached))
222
+ print(f'Cache: {len(all_files)-len(uncached)} files hit, {len(uncached)} files need extraction')
223
+ "
224
+ ```
225
+
226
+ Only dispatch subagents for files listed in `.graphify_uncached.txt`. If all files are cached, skip to Part C directly.
227
+
228
+ **Step B1 - Split into chunks**
229
+
230
+ 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.
231
+
232
+ **Step B2 - Dispatch ALL subagents in a single message (OpenCode)**
233
+
234
+ > **OpenCode platform:** Uses `@mention` dispatch instead of the Agent tool. All mentions in a single message run in parallel.
235
+
236
+ Dispatch one `@mention` per chunk — ALL in the same response:
237
+
238
+ ```
239
+ @agent Chunk CHUNK_NUM of TOTAL_CHUNKS: [extraction prompt below with FILE_LIST, CHUNK_NUM, TOTAL_CHUNKS, DEEP_MODE substituted]
240
+
241
+ @agent Chunk 2 of TOTAL_CHUNKS: [next chunk]
242
+ ```
243
+
244
+ Wait for all agents to return. Parse each response as JSON. Accumulate nodes/edges/hyperedges across all results and write to `.graphify_semantic_new.json`.
245
+
246
+ The extraction prompt each agent receives (substitute FILE_LIST, CHUNK_NUM, TOTAL_CHUNKS, DEEP_MODE):
247
+
248
+ ```
249
+ You are a graphify extraction subagent. Read the files listed and extract a knowledge graph fragment.
250
+ Output ONLY valid JSON matching the schema below - no explanation, no markdown fences, no preamble.
251
+
252
+ Files (chunk CHUNK_NUM of TOTAL_CHUNKS):
253
+ FILE_LIST
254
+
255
+ Rules:
256
+ - EXTRACTED: relationship explicit in source (import, call, citation, "see §3.2")
257
+ - INFERRED: reasonable inference (shared data structure, implied dependency)
258
+ - AMBIGUOUS: uncertain - flag for review, do not omit
259
+
260
+ Code files: focus on semantic edges AST cannot find (call relationships, shared data, arch patterns).
261
+ Do not re-extract imports - AST already has those.
262
+ 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.
263
+ Image files: use vision to understand what the image IS - do not just OCR.
264
+ UI screenshot: layout patterns, design decisions, key elements, purpose.
265
+ Chart: metric, trend/insight, data source.
266
+ Tweet/post: claim as node, author, concepts mentioned.
267
+ Diagram: components and connections.
268
+ Research figure: what it demonstrates, method, result.
269
+ Handwritten/whiteboard: ideas and arrows, mark uncertain readings AMBIGUOUS.
270
+
271
+ DEEP_MODE (if --mode deep was given): be aggressive with INFERRED edges - indirect deps,
272
+ shared assumptions, latent couplings. Mark uncertain ones AMBIGUOUS instead of omitting.
273
+
274
+ 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:
275
+ - Two functions that both validate user input but never call each other
276
+ - A class in code and a concept in a paper that describe the same algorithm
277
+ - Two error types that handle the same failure mode differently
278
+ Only add these when the similarity is genuinely non-obvious and cross-cutting. Do not add them for trivially similar things.
279
+
280
+ 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:
281
+ - All classes that implement a common protocol or interface
282
+ - All functions in an authentication flow (even if they don't all call each other)
283
+ - All concepts from a paper section that form one coherent idea
284
+ Use sparingly — only when the group relationship adds information beyond the pairwise edges. Maximum 3 hyperedges per chunk.
285
+
286
+ If a file has YAML frontmatter (--- ... ---), copy source_url, captured_at, author,
287
+ contributor onto every node from that file.
288
+
289
+ confidence_score is REQUIRED on every edge - never omit it, never use 0.5 as a default:
290
+ - EXTRACTED edges: confidence_score = 1.0 always
291
+ - INFERRED edges: reason about each edge individually.
292
+ Direct structural evidence (shared data structure, clear dependency): 0.8-0.9.
293
+ Reasonable inference with some uncertainty: 0.6-0.7.
294
+ Weak or speculative: 0.4-0.5. Most edges should be 0.6-0.9, not 0.5.
295
+ - AMBIGUOUS edges: 0.1-0.3
296
+
297
+ Output exactly this JSON (no other text):
298
+ {"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}
299
+ ```
300
+
301
+ **Step B3 - Collect, cache, and merge**
302
+
303
+ Wait for all subagents. For each result:
304
+ - Check that `graphify-out/.graphify_chunk_NN.json` exists on disk — this is the success signal
305
+ - If the file exists and contains valid JSON with `nodes` and `edges`, include it and save to cache
306
+ - 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.
307
+ - If a subagent failed or returned invalid JSON, print a warning and skip that chunk - do not abort
308
+
309
+ 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.
310
+
311
+ Save new results to cache:
312
+ ```bash
313
+ $(cat .graphify_python) -c "
314
+ import json
315
+ from graphify.cache import save_semantic_cache
316
+ from pathlib import Path
317
+
318
+ new = json.loads(Path('.graphify_semantic_new.json').read_text()) if Path('.graphify_semantic_new.json').exists() else {'nodes':[],'edges':[],'hyperedges':[]}
319
+ saved = save_semantic_cache(new.get('nodes', []), new.get('edges', []), new.get('hyperedges', []))
320
+ print(f'Cached {saved} files')
321
+ "
322
+ ```
323
+
324
+ Merge cached + new results into `.graphify_semantic.json`:
325
+ ```bash
326
+ $(cat .graphify_python) -c "
327
+ import json
328
+ from pathlib import Path
329
+
330
+ cached = json.loads(Path('.graphify_cached.json').read_text()) if Path('.graphify_cached.json').exists() else {'nodes':[],'edges':[],'hyperedges':[]}
331
+ new = json.loads(Path('.graphify_semantic_new.json').read_text()) if Path('.graphify_semantic_new.json').exists() else {'nodes':[],'edges':[],'hyperedges':[]}
332
+
333
+ all_nodes = cached['nodes'] + new.get('nodes', [])
334
+ all_edges = cached['edges'] + new.get('edges', [])
335
+ all_hyperedges = cached.get('hyperedges', []) + new.get('hyperedges', [])
336
+ seen = set()
337
+ deduped = []
338
+ for n in all_nodes:
339
+ if n['id'] not in seen:
340
+ seen.add(n['id'])
341
+ deduped.append(n)
342
+
343
+ merged = {
344
+ 'nodes': deduped,
345
+ 'edges': all_edges,
346
+ 'hyperedges': all_hyperedges,
347
+ 'input_tokens': new.get('input_tokens', 0),
348
+ 'output_tokens': new.get('output_tokens', 0),
349
+ }
350
+ Path('.graphify_semantic.json').write_text(json.dumps(merged, indent=2))
351
+ print(f'Extraction complete - {len(deduped)} nodes, {len(all_edges)} edges ({len(cached[\"nodes\"])} from cache, {len(new.get(\"nodes\",[]))} new)')
352
+ "
353
+ ```
354
+ Clean up temp files: `rm -f .graphify_cached.json .graphify_uncached.txt .graphify_semantic_new.json`
355
+
356
+ #### Part C - Merge AST + semantic into final extraction
357
+
358
+ ```bash
359
+ $(cat .graphify_python) -c "
360
+ import sys, json
361
+ from pathlib import Path
362
+
363
+ ast = json.loads(Path('.graphify_ast.json').read_text())
364
+ sem = json.loads(Path('.graphify_semantic.json').read_text())
365
+
366
+ # Merge: AST nodes first, semantic nodes deduplicated by id
367
+ seen = {n['id'] for n in ast['nodes']}
368
+ merged_nodes = list(ast['nodes'])
369
+ for n in sem['nodes']:
370
+ if n['id'] not in seen:
371
+ merged_nodes.append(n)
372
+ seen.add(n['id'])
373
+
374
+ merged_edges = ast['edges'] + sem['edges']
375
+ merged_hyperedges = sem.get('hyperedges', [])
376
+ merged = {
377
+ 'nodes': merged_nodes,
378
+ 'edges': merged_edges,
379
+ 'hyperedges': merged_hyperedges,
380
+ 'input_tokens': sem.get('input_tokens', 0),
381
+ 'output_tokens': sem.get('output_tokens', 0),
382
+ }
383
+ Path('.graphify_extract.json').write_text(json.dumps(merged, indent=2))
384
+ total = len(merged_nodes)
385
+ edges = len(merged_edges)
386
+ print(f'Merged: {total} nodes, {edges} edges ({len(ast[\"nodes\"])} AST + {len(sem[\"nodes\"])} semantic)')
387
+ "
388
+ ```
389
+
390
+ ### Step 4 - Build graph, cluster, analyze, generate outputs
391
+
392
+ ```bash
393
+ mkdir -p graphify-out
394
+ $(cat .graphify_python) -c "
395
+ import sys, json
396
+ from graphify.build import build_from_json
397
+ from graphify.cluster import cluster, score_all
398
+ from graphify.analyze import god_nodes, surprising_connections, suggest_questions
399
+ from graphify.report import generate
400
+ from graphify.export import to_json
401
+ from pathlib import Path
402
+
403
+ extraction = json.loads(Path('.graphify_extract.json').read_text())
404
+ detection = json.loads(Path('.graphify_detect.json').read_text())
405
+
406
+ G = build_from_json(extraction)
407
+ communities = cluster(G)
408
+ cohesion = score_all(G, communities)
409
+ tokens = {'input': extraction.get('input_tokens', 0), 'output': extraction.get('output_tokens', 0)}
410
+ gods = god_nodes(G)
411
+ surprises = surprising_connections(G, communities)
412
+ labels = {cid: 'Community ' + str(cid) for cid in communities}
413
+ # Placeholder questions - regenerated with real labels in Step 5
414
+ questions = suggest_questions(G, communities, labels)
415
+
416
+ report = generate(G, communities, cohesion, labels, gods, surprises, detection, tokens, 'INPUT_PATH', suggested_questions=questions)
417
+ Path('graphify-out/GRAPH_REPORT.md').write_text(report)
418
+ to_json(G, communities, 'graphify-out/graph.json')
419
+
420
+ analysis = {
421
+ 'communities': {str(k): v for k, v in communities.items()},
422
+ 'cohesion': {str(k): v for k, v in cohesion.items()},
423
+ 'gods': gods,
424
+ 'surprises': surprises,
425
+ 'questions': questions,
426
+ }
427
+ Path('.graphify_analysis.json').write_text(json.dumps(analysis, indent=2))
428
+ if G.number_of_nodes() == 0:
429
+ print('ERROR: Graph is empty - extraction produced no nodes.')
430
+ print('Possible causes: all files were skipped, binary-only corpus, or extraction failed.')
431
+ raise SystemExit(1)
432
+ print(f'Graph: {G.number_of_nodes()} nodes, {G.number_of_edges()} edges, {len(communities)} communities')
433
+ "
434
+ ```
435
+
436
+ If this step prints `ERROR: Graph is empty`, stop and tell the user what happened - do not proceed to labeling or visualization.
437
+
438
+ Replace INPUT_PATH with the actual path.
439
+
440
+ ### Step 5 - Label communities
441
+
442
+ 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").
443
+
444
+ Then regenerate the report and save the labels for the visualizer:
445
+
446
+ ```bash
447
+ $(cat .graphify_python) -c "
448
+ import sys, json
449
+ from graphify.build import build_from_json
450
+ from graphify.cluster import score_all
451
+ from graphify.analyze import god_nodes, surprising_connections, suggest_questions
452
+ from graphify.report import generate
453
+ from pathlib import Path
454
+
455
+ extraction = json.loads(Path('.graphify_extract.json').read_text())
456
+ detection = json.loads(Path('.graphify_detect.json').read_text())
457
+ analysis = json.loads(Path('.graphify_analysis.json').read_text())
458
+
459
+ G = build_from_json(extraction)
460
+ communities = {int(k): v for k, v in analysis['communities'].items()}
461
+ cohesion = {int(k): v for k, v in analysis['cohesion'].items()}
462
+ tokens = {'input': extraction.get('input_tokens', 0), 'output': extraction.get('output_tokens', 0)}
463
+
464
+ # LABELS - replace these with the names you chose above
465
+ labels = LABELS_DICT
466
+
467
+ # Regenerate questions with real community labels (labels affect question phrasing)
468
+ questions = suggest_questions(G, communities, labels)
469
+
470
+ report = generate(G, communities, cohesion, labels, analysis['gods'], analysis['surprises'], detection, tokens, 'INPUT_PATH', suggested_questions=questions)
471
+ Path('graphify-out/GRAPH_REPORT.md').write_text(report)
472
+ Path('.graphify_labels.json').write_text(json.dumps({str(k): v for k, v in labels.items()}))
473
+ print('Report updated with community labels')
474
+ "
475
+ ```
476
+
477
+ Replace `LABELS_DICT` with the actual dict you constructed (e.g. `{0: "Attention Mechanism", 1: "Training Pipeline"}`).
478
+ Replace INPUT_PATH with the actual path.
479
+
480
+ ### Step 6 - Generate Obsidian vault (opt-in) + HTML
481
+
482
+ **Generate HTML always** (unless `--no-viz`). **Obsidian vault only if `--obsidian` was explicitly given** — skip it otherwise, it generates one file per node.
483
+
484
+ If `--obsidian` was given:
485
+
486
+ ```bash
487
+ $(cat .graphify_python) -c "
488
+ import sys, json
489
+ from graphify.build import build_from_json
490
+ from graphify.export import to_obsidian, to_canvas
491
+ from pathlib import Path
492
+
493
+ extraction = json.loads(Path('.graphify_extract.json').read_text())
494
+ analysis = json.loads(Path('.graphify_analysis.json').read_text())
495
+ labels_raw = json.loads(Path('.graphify_labels.json').read_text()) if Path('.graphify_labels.json').exists() else {}
496
+
497
+ G = build_from_json(extraction)
498
+ communities = {int(k): v for k, v in analysis['communities'].items()}
499
+ cohesion = {int(k): v for k, v in analysis['cohesion'].items()}
500
+ labels = {int(k): v for k, v in labels_raw.items()}
501
+
502
+ n = to_obsidian(G, communities, 'graphify-out/obsidian', community_labels=labels or None, cohesion=cohesion)
503
+ print(f'Obsidian vault: {n} notes in graphify-out/obsidian/')
504
+
505
+ to_canvas(G, communities, 'graphify-out/obsidian/graph.canvas', community_labels=labels or None)
506
+ print('Canvas: graphify-out/obsidian/graph.canvas - open in Obsidian for structured community layout')
507
+ print()
508
+ print('Open graphify-out/obsidian/ as a vault in Obsidian.')
509
+ print(' Graph view - nodes colored by community (set automatically)')
510
+ print(' graph.canvas - structured layout with communities as groups')
511
+ print(' _COMMUNITY_* - overview notes with cohesion scores and dataview queries')
512
+ "
513
+ ```
514
+
515
+ Generate the HTML graph (always, unless `--no-viz`):
516
+
517
+ ```bash
518
+ $(cat .graphify_python) -c "
519
+ import sys, json
520
+ from graphify.build import build_from_json
521
+ from graphify.export import to_html
522
+ from pathlib import Path
523
+
524
+ extraction = json.loads(Path('.graphify_extract.json').read_text())
525
+ analysis = json.loads(Path('.graphify_analysis.json').read_text())
526
+ labels_raw = json.loads(Path('.graphify_labels.json').read_text()) if Path('.graphify_labels.json').exists() else {}
527
+
528
+ G = build_from_json(extraction)
529
+ communities = {int(k): v for k, v in analysis['communities'].items()}
530
+ labels = {int(k): v for k, v in labels_raw.items()}
531
+
532
+ if G.number_of_nodes() > 5000:
533
+ print(f'Graph has {G.number_of_nodes()} nodes - too large for HTML viz. Use Obsidian vault instead.')
534
+ else:
535
+ to_html(G, communities, 'graphify-out/graph.html', community_labels=labels or None)
536
+ print('graph.html written - open in any browser, no server needed')
537
+ "
538
+ ```
539
+
540
+ ### Step 7 - Neo4j export (only if --neo4j or --neo4j-push flag)
541
+
542
+ **If `--neo4j`** - generate a Cypher file for manual import:
543
+
544
+ ```bash
545
+ $(cat .graphify_python) -c "
546
+ import sys, json
547
+ from graphify.build import build_from_json
548
+ from graphify.export import to_cypher
549
+ from pathlib import Path
550
+
551
+ G = build_from_json(json.loads(Path('.graphify_extract.json').read_text()))
552
+ to_cypher(G, 'graphify-out/cypher.txt')
553
+ print('cypher.txt written - import with: cypher-shell < graphify-out/cypher.txt')
554
+ "
555
+ ```
556
+
557
+ **If `--neo4j-push <uri>`** - push directly to a running Neo4j instance. Ask the user for credentials if not provided:
558
+
559
+ ```bash
560
+ $(cat .graphify_python) -c "
561
+ import sys, json
562
+ from graphify.build import build_from_json
563
+ from graphify.cluster import cluster
564
+ from graphify.export import push_to_neo4j
565
+ from pathlib import Path
566
+
567
+ extraction = json.loads(Path('.graphify_extract.json').read_text())
568
+ analysis = json.loads(Path('.graphify_analysis.json').read_text())
569
+ G = build_from_json(extraction)
570
+ communities = {int(k): v for k, v in analysis['communities'].items()}
571
+
572
+ result = push_to_neo4j(G, uri='NEO4J_URI', user='NEO4J_USER', password='NEO4J_PASSWORD', communities=communities)
573
+ print(f'Pushed to Neo4j: {result[\"nodes\"]} nodes, {result[\"edges\"]} edges')
574
+ "
575
+ ```
576
+
577
+ 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.
578
+
579
+ ### Step 7b - SVG export (only if --svg flag)
580
+
581
+ ```bash
582
+ $(cat .graphify_python) -c "
583
+ import sys, json
584
+ from graphify.build import build_from_json
585
+ from graphify.export import to_svg
586
+ from pathlib import Path
587
+
588
+ extraction = json.loads(Path('.graphify_extract.json').read_text())
589
+ analysis = json.loads(Path('.graphify_analysis.json').read_text())
590
+ labels_raw = json.loads(Path('.graphify_labels.json').read_text()) if Path('.graphify_labels.json').exists() else {}
591
+
592
+ G = build_from_json(extraction)
593
+ communities = {int(k): v for k, v in analysis['communities'].items()}
594
+ labels = {int(k): v for k, v in labels_raw.items()}
595
+
596
+ to_svg(G, communities, 'graphify-out/graph.svg', community_labels=labels or None)
597
+ print('graph.svg written - embeds in Obsidian, Notion, GitHub READMEs')
598
+ "
599
+ ```
600
+
601
+ ### Step 7c - GraphML export (only if --graphml flag)
602
+
603
+ ```bash
604
+ $(cat .graphify_python) -c "
605
+ import json
606
+ from graphify.build import build_from_json
607
+ from graphify.export import to_graphml
608
+ from pathlib import Path
609
+
610
+ extraction = json.loads(Path('.graphify_extract.json').read_text())
611
+ analysis = json.loads(Path('.graphify_analysis.json').read_text())
612
+
613
+ G = build_from_json(extraction)
614
+ communities = {int(k): v for k, v in analysis['communities'].items()}
615
+
616
+ to_graphml(G, communities, 'graphify-out/graph.graphml')
617
+ print('graph.graphml written - open in Gephi, yEd, or any GraphML tool')
618
+ "
619
+ ```
620
+
621
+ ### Step 7d - MCP server (only if --mcp flag)
622
+
623
+ ```bash
624
+ python3 -m graphify.serve graphify-out/graph.json
625
+ ```
626
+
627
+ 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.
628
+
629
+ To configure in Claude Desktop, add to `claude_desktop_config.json`:
630
+ ```json
631
+ {
632
+ "mcpServers": {
633
+ "graphify": {
634
+ "command": "python3",
635
+ "args": ["-m", "graphify.serve", "/absolute/path/to/graphify-out/graph.json"]
636
+ }
637
+ }
638
+ }
639
+ ```
640
+
641
+ ### Step 8 - Token reduction benchmark (only if total_words > 5000)
642
+
643
+ If `total_words` from `.graphify_detect.json` is greater than 5,000, run:
644
+
645
+ ```bash
646
+ $(cat .graphify_python) -c "
647
+ import json
648
+ from graphify.benchmark import run_benchmark, print_benchmark
649
+ from pathlib import Path
650
+
651
+ detection = json.loads(Path('.graphify_detect.json').read_text())
652
+ result = run_benchmark('graphify-out/graph.json', corpus_words=detection['total_words'])
653
+ print_benchmark(result)
654
+ "
655
+ ```
656
+
657
+ Print the output directly in chat. If `total_words <= 5000`, skip silently - the graph value is structural clarity, not token compression, for small corpora.
658
+
659
+ ---
660
+
661
+ ### Step 9 - Save manifest, update cost tracker, clean up, and report
662
+
663
+ ```bash
664
+ $(cat .graphify_python) -c "
665
+ import json
666
+ from pathlib import Path
667
+ from datetime import datetime, timezone
668
+ from graphify.detect import save_manifest
669
+
670
+ # Save manifest for --update
671
+ detect = json.loads(Path('.graphify_detect.json').read_text())
672
+ save_manifest(detect['files'])
673
+
674
+ # Update cumulative cost tracker
675
+ extract = json.loads(Path('.graphify_extract.json').read_text())
676
+ input_tok = extract.get('input_tokens', 0)
677
+ output_tok = extract.get('output_tokens', 0)
678
+
679
+ cost_path = Path('graphify-out/cost.json')
680
+ if cost_path.exists():
681
+ cost = json.loads(cost_path.read_text())
682
+ else:
683
+ cost = {'runs': [], 'total_input_tokens': 0, 'total_output_tokens': 0}
684
+
685
+ cost['runs'].append({
686
+ 'date': datetime.now(timezone.utc).isoformat(),
687
+ 'input_tokens': input_tok,
688
+ 'output_tokens': output_tok,
689
+ 'files': detect.get('total_files', 0),
690
+ })
691
+ cost['total_input_tokens'] += input_tok
692
+ cost['total_output_tokens'] += output_tok
693
+ cost_path.write_text(json.dumps(cost, indent=2))
694
+
695
+ print(f'This run: {input_tok:,} input tokens, {output_tok:,} output tokens')
696
+ print(f'All time: {cost[\"total_input_tokens\"]:,} input, {cost[\"total_output_tokens\"]:,} output ({len(cost[\"runs\"])} runs)')
697
+ "
698
+ rm -f .graphify_detect.json .graphify_extract.json .graphify_ast.json .graphify_semantic.json .graphify_analysis.json .graphify_labels.json
699
+ rm -f graphify-out/.needs_update 2>/dev/null || true
700
+ ```
701
+
702
+ Tell the user (omit the obsidian line unless --obsidian was given):
703
+ ```
704
+ Graph complete. Outputs in PATH_TO_DIR/graphify-out/
705
+
706
+ graph.html - interactive graph, open in browser
707
+ GRAPH_REPORT.md - audit report
708
+ graph.json - raw graph data
709
+ obsidian/ - Obsidian vault (only if --obsidian was given)
710
+ ```
711
+
712
+ If graphify saved you time, consider supporting it: https://github.com/sponsors/safishamsi
713
+
714
+ Replace PATH_TO_DIR with the actual absolute path of the directory that was processed.
715
+
716
+ Then paste these sections from GRAPH_REPORT.md directly into the chat:
717
+ - God Nodes
718
+ - Surprising Connections
719
+ - Suggested Questions
720
+
721
+ Do NOT paste the full report - just those three sections. Keep it concise.
722
+
723
+ 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:
724
+
725
+ > "The most interesting question this graph can answer: **[question]**. Want me to trace it?"
726
+
727
+ 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.
728
+
729
+ The graph is the map. Your job after the pipeline is to be the guide.
730
+
731
+ ---
732
+
733
+ ## For --update (incremental re-extraction)
734
+
735
+ Use when you've added or modified files since the last run. Only re-extracts changed files - saves tokens and time.
736
+
737
+ ```bash
738
+ $(cat .graphify_python) -c "
739
+ import sys, json
740
+ from graphify.detect import detect_incremental, save_manifest
741
+ from pathlib import Path
742
+
743
+ result = detect_incremental(Path('INPUT_PATH'))
744
+ new_total = result.get('new_total', 0)
745
+ print(json.dumps(result, indent=2))
746
+ Path('.graphify_incremental.json').write_text(json.dumps(result))
747
+ if new_total == 0:
748
+ print('No files changed since last run. Nothing to update.')
749
+ raise SystemExit(0)
750
+ print(f'{new_total} new/changed file(s) to re-extract.')
751
+ "
752
+ ```
753
+
754
+ If new files exist, first check whether all changed files are code files:
755
+
756
+ ```bash
757
+ $(cat .graphify_python) -c "
758
+ import json
759
+ from pathlib import Path
760
+
761
+ result = json.loads(open('.graphify_incremental.json').read()) if Path('.graphify_incremental.json').exists() else {}
762
+ code_exts = {'.py','.ts','.js','.go','.rs','.java','.cpp','.c','.rb','.swift','.kt','.cs','.scala','.php','.cc','.cxx','.hpp','.h','.kts'}
763
+ new_files = result.get('new_files', {})
764
+ all_changed = [f for files in new_files.values() for f in files]
765
+ code_only = all(Path(f).suffix.lower() in code_exts for f in all_changed)
766
+ print('code_only:', code_only)
767
+ "
768
+ ```
769
+
770
+ 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.
771
+
772
+ If `code_only` is False (any changed file is a doc/paper/image): run the full Steps 3A–3C pipeline as normal.
773
+
774
+ Then:
775
+
776
+ ```bash
777
+ $(cat .graphify_python) -c "
778
+ import sys, json
779
+ from graphify.build import build_from_json
780
+ from graphify.export import to_json
781
+ from networkx.readwrite import json_graph
782
+ import networkx as nx
783
+ from pathlib import Path
784
+
785
+ # Load existing graph
786
+ existing_data = json.loads(Path('graphify-out/graph.json').read_text())
787
+ G_existing = json_graph.node_link_graph(existing_data, edges='links')
788
+
789
+ # Load new extraction
790
+ new_extraction = json.loads(Path('.graphify_extract.json').read_text())
791
+ G_new = build_from_json(new_extraction)
792
+
793
+ # Merge: new nodes/edges into existing graph
794
+ G_existing.update(G_new)
795
+ print(f'Merged: {G_existing.number_of_nodes()} nodes, {G_existing.number_of_edges()} edges')
796
+ "
797
+ ```
798
+
799
+ Then run Steps 4–8 on the merged graph as normal.
800
+
801
+ After Step 4, show the graph diff:
802
+
803
+ ```bash
804
+ $(cat .graphify_python) -c "
805
+ import json
806
+ from graphify.analyze import graph_diff
807
+ from graphify.build import build_from_json
808
+ from networkx.readwrite import json_graph
809
+ import networkx as nx
810
+ from pathlib import Path
811
+
812
+ # Load old graph (before update) from backup written before merge
813
+ old_data = json.loads(Path('.graphify_old.json').read_text()) if Path('.graphify_old.json').exists() else None
814
+ new_extract = json.loads(Path('.graphify_extract.json').read_text())
815
+ G_new = build_from_json(new_extract)
816
+
817
+ if old_data:
818
+ G_old = json_graph.node_link_graph(old_data, edges='links')
819
+ diff = graph_diff(G_old, G_new)
820
+ print(diff['summary'])
821
+ if diff['new_nodes']:
822
+ print('New nodes:', ', '.join(n['label'] for n in diff['new_nodes'][:5]))
823
+ if diff['new_edges']:
824
+ print('New edges:', len(diff['new_edges']))
825
+ "
826
+ ```
827
+
828
+ Before the merge step, save the old graph: `cp graphify-out/graph.json .graphify_old.json`
829
+ Clean up after: `rm -f .graphify_old.json`
830
+
831
+ ---
832
+
833
+ ## For --cluster-only
834
+
835
+ Skip Steps 1–3. Load the existing graph from `graphify-out/graph.json` and re-run clustering:
836
+
837
+ ```bash
838
+ $(cat .graphify_python) -c "
839
+ import sys, json
840
+ from graphify.cluster import cluster, score_all
841
+ from graphify.analyze import god_nodes, surprising_connections
842
+ from graphify.report import generate
843
+ from graphify.export import to_json
844
+ from networkx.readwrite import json_graph
845
+ import networkx as nx
846
+ from pathlib import Path
847
+
848
+ data = json.loads(Path('graphify-out/graph.json').read_text())
849
+ G = json_graph.node_link_graph(data, edges='links')
850
+
851
+ detection = {'total_files': 0, 'total_words': 99999, 'needs_graph': True, 'warning': None,
852
+ 'files': {'code': [], 'document': [], 'paper': []}}
853
+ tokens = {'input': 0, 'output': 0}
854
+
855
+ communities = cluster(G)
856
+ cohesion = score_all(G, communities)
857
+ gods = god_nodes(G)
858
+ surprises = surprising_connections(G, communities)
859
+ labels = {cid: 'Community ' + str(cid) for cid in communities}
860
+
861
+ report = generate(G, communities, cohesion, labels, gods, surprises, detection, tokens, '.')
862
+ Path('graphify-out/GRAPH_REPORT.md').write_text(report)
863
+ to_json(G, communities, 'graphify-out/graph.json')
864
+
865
+ analysis = {
866
+ 'communities': {str(k): v for k, v in communities.items()},
867
+ 'cohesion': {str(k): v for k, v in cohesion.items()},
868
+ 'gods': gods,
869
+ 'surprises': surprises,
870
+ }
871
+ Path('.graphify_analysis.json').write_text(json.dumps(analysis, indent=2))
872
+ print(f'Re-clustered: {len(communities)} communities')
873
+ "
874
+ ```
875
+
876
+ Then run Steps 5–9 as normal (label communities, generate viz, benchmark, clean up, report).
877
+
878
+ ---
879
+
880
+ ## For /graphify query
881
+
882
+ Two traversal modes - choose based on the question:
883
+
884
+ | Mode | Flag | Best for |
885
+ |------|------|----------|
886
+ | BFS (default) | _(none)_ | "What is X connected to?" - broad context, nearest neighbors first |
887
+ | DFS | `--dfs` | "How does X reach Y?" - trace a specific chain or dependency path |
888
+
889
+ First check the graph exists:
890
+ ```bash
891
+ $(cat .graphify_python) -c "
892
+ from pathlib import Path
893
+ if not Path('graphify-out/graph.json').exists():
894
+ print('ERROR: No graph found. Run /graphify <path> first to build the graph.')
895
+ raise SystemExit(1)
896
+ "
897
+ ```
898
+ If it fails, stop and tell the user to run `/graphify <path>` first.
899
+
900
+ Load `graphify-out/graph.json`, then:
901
+
902
+ 1. Find the 1-3 nodes whose label best matches key terms in the question.
903
+ 2. Run the appropriate traversal from each starting node.
904
+ 3. Read the subgraph - node labels, edge relations, confidence tags, source locations.
905
+ 4. Answer using **only** what the graph contains. Quote `source_location` when citing a specific fact.
906
+ 5. If the graph lacks enough information, say so - do not hallucinate edges.
907
+
908
+ ```bash
909
+ $(cat .graphify_python) -c "
910
+ import sys, json
911
+ from networkx.readwrite import json_graph
912
+ import networkx as nx
913
+ from pathlib import Path
914
+
915
+ data = json.loads(Path('graphify-out/graph.json').read_text())
916
+ G = json_graph.node_link_graph(data, edges='links')
917
+
918
+ question = 'QUESTION'
919
+ mode = 'MODE' # 'bfs' or 'dfs'
920
+ terms = [t.lower() for t in question.split() if len(t) > 3]
921
+
922
+ # Find best-matching start nodes
923
+ scored = []
924
+ for nid, ndata in G.nodes(data=True):
925
+ label = ndata.get('label', '').lower()
926
+ score = sum(1 for t in terms if t in label)
927
+ if score > 0:
928
+ scored.append((score, nid))
929
+ scored.sort(reverse=True)
930
+ start_nodes = [nid for _, nid in scored[:3]]
931
+
932
+ if not start_nodes:
933
+ print('No matching nodes found for query terms:', terms)
934
+ sys.exit(0)
935
+
936
+ subgraph_nodes = set()
937
+ subgraph_edges = []
938
+
939
+ if mode == 'dfs':
940
+ # DFS: follow one path as deep as possible before backtracking.
941
+ # Depth-limited to 6 to avoid traversing the whole graph.
942
+ visited = set()
943
+ stack = [(n, 0) for n in reversed(start_nodes)]
944
+ while stack:
945
+ node, depth = stack.pop()
946
+ if node in visited or depth > 6:
947
+ continue
948
+ visited.add(node)
949
+ subgraph_nodes.add(node)
950
+ for neighbor in G.neighbors(node):
951
+ if neighbor not in visited:
952
+ stack.append((neighbor, depth + 1))
953
+ subgraph_edges.append((node, neighbor))
954
+ else:
955
+ # BFS: explore all neighbors layer by layer up to depth 3.
956
+ frontier = set(start_nodes)
957
+ subgraph_nodes = set(start_nodes)
958
+ for _ in range(3):
959
+ next_frontier = set()
960
+ for n in frontier:
961
+ for neighbor in G.neighbors(n):
962
+ if neighbor not in subgraph_nodes:
963
+ next_frontier.add(neighbor)
964
+ subgraph_edges.append((n, neighbor))
965
+ subgraph_nodes.update(next_frontier)
966
+ frontier = next_frontier
967
+
968
+ # Token-budget aware output: rank by relevance, cut at budget (~4 chars/token)
969
+ token_budget = BUDGET # default 2000
970
+ char_budget = token_budget * 4
971
+
972
+ # Score each node by term overlap for ranked output
973
+ def relevance(nid):
974
+ label = G.nodes[nid].get('label', '').lower()
975
+ return sum(1 for t in terms if t in label)
976
+
977
+ ranked_nodes = sorted(subgraph_nodes, key=relevance, reverse=True)
978
+
979
+ lines = [f'Traversal: {mode.upper()} | Start: {[G.nodes[n].get(\"label\",n) for n in start_nodes]} | {len(subgraph_nodes)} nodes']
980
+ for nid in ranked_nodes:
981
+ d = G.nodes[nid]
982
+ lines.append(f' NODE {d.get(\"label\", nid)} [src={d.get(\"source_file\",\"\")} loc={d.get(\"source_location\",\"\")}]')
983
+ for u, v in subgraph_edges:
984
+ if u in subgraph_nodes and v in subgraph_nodes:
985
+ d = G.edges[u, v]
986
+ lines.append(f' EDGE {G.nodes[u].get(\"label\",u)} --{d.get(\"relation\",\"\")} [{d.get(\"confidence\",\"\")}]--> {G.nodes[v].get(\"label\",v)}')
987
+
988
+ output = '\n'.join(lines)
989
+ if len(output) > char_budget:
990
+ output = output[:char_budget] + f'\n... (truncated at ~{token_budget} token budget - use --budget N for more)'
991
+ print(output)
992
+ "
993
+ ```
994
+
995
+ 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.
996
+
997
+ After writing the answer, save it back into the graph so it improves future queries:
998
+
999
+ ```bash
1000
+ $(cat .graphify_python) -m graphify save-result --question "QUESTION" --answer "ANSWER" --type query --nodes NODE1 NODE2
1001
+ ```
1002
+
1003
+ 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.
1004
+
1005
+ ---
1006
+
1007
+ ## For /graphify path
1008
+
1009
+ Find the shortest path between two named concepts in the graph.
1010
+
1011
+ First check the graph exists:
1012
+ ```bash
1013
+ $(cat .graphify_python) -c "
1014
+ from pathlib import Path
1015
+ if not Path('graphify-out/graph.json').exists():
1016
+ print('ERROR: No graph found. Run /graphify <path> first to build the graph.')
1017
+ raise SystemExit(1)
1018
+ "
1019
+ ```
1020
+ If it fails, stop and tell the user to run `/graphify <path>` first.
1021
+
1022
+ ```bash
1023
+ $(cat .graphify_python) -c "
1024
+ import json, sys
1025
+ import networkx as nx
1026
+ from networkx.readwrite import json_graph
1027
+ from pathlib import Path
1028
+
1029
+ data = json.loads(Path('graphify-out/graph.json').read_text())
1030
+ G = json_graph.node_link_graph(data, edges='links')
1031
+
1032
+ a_term = 'NODE_A'
1033
+ b_term = 'NODE_B'
1034
+
1035
+ def find_node(term):
1036
+ term = term.lower()
1037
+ scored = sorted(
1038
+ [(sum(1 for w in term.split() if w in G.nodes[n].get('label','').lower()), n)
1039
+ for n in G.nodes()],
1040
+ reverse=True
1041
+ )
1042
+ return scored[0][1] if scored and scored[0][0] > 0 else None
1043
+
1044
+ src = find_node(a_term)
1045
+ tgt = find_node(b_term)
1046
+
1047
+ if not src or not tgt:
1048
+ print(f'Could not find nodes matching: {a_term!r} or {b_term!r}')
1049
+ sys.exit(0)
1050
+
1051
+ try:
1052
+ path = nx.shortest_path(G, src, tgt)
1053
+ print(f'Shortest path ({len(path)-1} hops):')
1054
+ for i, nid in enumerate(path):
1055
+ label = G.nodes[nid].get('label', nid)
1056
+ if i < len(path) - 1:
1057
+ edge = G.edges[nid, path[i+1]]
1058
+ rel = edge.get('relation', '')
1059
+ conf = edge.get('confidence', '')
1060
+ print(f' {label} --{rel}--> [{conf}]')
1061
+ else:
1062
+ print(f' {label}')
1063
+ except nx.NetworkXNoPath:
1064
+ print(f'No path found between {a_term!r} and {b_term!r}')
1065
+ except nx.NodeNotFound as e:
1066
+ print(f'Node not found: {e}')
1067
+ "
1068
+ ```
1069
+
1070
+ 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.
1071
+
1072
+ After writing the explanation, save it back:
1073
+
1074
+ ```bash
1075
+ $(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
1076
+ ```
1077
+
1078
+ ---
1079
+
1080
+ ## For /graphify explain
1081
+
1082
+ Give a plain-language explanation of a single node - everything connected to it.
1083
+
1084
+ First check the graph exists:
1085
+ ```bash
1086
+ $(cat .graphify_python) -c "
1087
+ from pathlib import Path
1088
+ if not Path('graphify-out/graph.json').exists():
1089
+ print('ERROR: No graph found. Run /graphify <path> first to build the graph.')
1090
+ raise SystemExit(1)
1091
+ "
1092
+ ```
1093
+ If it fails, stop and tell the user to run `/graphify <path>` first.
1094
+
1095
+ ```bash
1096
+ $(cat .graphify_python) -c "
1097
+ import json, sys
1098
+ import networkx as nx
1099
+ from networkx.readwrite import json_graph
1100
+ from pathlib import Path
1101
+
1102
+ data = json.loads(Path('graphify-out/graph.json').read_text())
1103
+ G = json_graph.node_link_graph(data, edges='links')
1104
+
1105
+ term = 'NODE_NAME'
1106
+ term_lower = term.lower()
1107
+
1108
+ # Find best matching node
1109
+ scored = sorted(
1110
+ [(sum(1 for w in term_lower.split() if w in G.nodes[n].get('label','').lower()), n)
1111
+ for n in G.nodes()],
1112
+ reverse=True
1113
+ )
1114
+ if not scored or scored[0][0] == 0:
1115
+ print(f'No node matching {term!r}')
1116
+ sys.exit(0)
1117
+
1118
+ nid = scored[0][1]
1119
+ data_n = G.nodes[nid]
1120
+ print(f'NODE: {data_n.get(\"label\", nid)}')
1121
+ print(f' source: {data_n.get(\"source_file\",\"unknown\")}')
1122
+ print(f' type: {data_n.get(\"file_type\",\"unknown\")}')
1123
+ print(f' degree: {G.degree(nid)}')
1124
+ print()
1125
+ print('CONNECTIONS:')
1126
+ for neighbor in G.neighbors(nid):
1127
+ edge = G.edges[nid, neighbor]
1128
+ nlabel = G.nodes[neighbor].get('label', neighbor)
1129
+ rel = edge.get('relation', '')
1130
+ conf = edge.get('confidence', '')
1131
+ src_file = G.nodes[neighbor].get('source_file', '')
1132
+ print(f' --{rel}--> {nlabel} [{conf}] ({src_file})')
1133
+ "
1134
+ ```
1135
+
1136
+ 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.
1137
+
1138
+ After writing the explanation, save it back:
1139
+
1140
+ ```bash
1141
+ $(cat .graphify_python) -m graphify save-result --question "Explain NODE_NAME" --answer "ANSWER" --type explain --nodes NODE_NAME
1142
+ ```
1143
+
1144
+ ---
1145
+
1146
+ ## For /graphify add
1147
+
1148
+ Fetch a URL and add it to the corpus, then update the graph.
1149
+
1150
+ ```bash
1151
+ $(cat .graphify_python) -c "
1152
+ import sys
1153
+ from graphify.ingest import ingest
1154
+ from pathlib import Path
1155
+
1156
+ try:
1157
+ out = ingest('URL', Path('./raw'), author='AUTHOR', contributor='CONTRIBUTOR')
1158
+ print(f'Saved to {out}')
1159
+ except ValueError as e:
1160
+ print(f'error: {e}', file=sys.stderr)
1161
+ sys.exit(1)
1162
+ except RuntimeError as e:
1163
+ print(f'error: {e}', file=sys.stderr)
1164
+ sys.exit(1)
1165
+ "
1166
+ ```
1167
+
1168
+ 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.
1169
+
1170
+ Supported URL types (auto-detected):
1171
+ - Twitter/X → fetched via oEmbed, saved as `.md` with tweet text and author
1172
+ - arXiv → abstract + metadata saved as `.md`
1173
+ - PDF → downloaded as `.pdf`
1174
+ - Images (.png/.jpg/.webp) → downloaded, vision extraction runs on next build
1175
+ - Any webpage → converted to markdown via html2text
1176
+
1177
+ ---
1178
+
1179
+ ## For --watch
1180
+
1181
+ Start a background watcher that monitors a folder and auto-updates the graph when files change.
1182
+
1183
+ ```bash
1184
+ python3 -m graphify.watch INPUT_PATH --debounce 3
1185
+ ```
1186
+
1187
+ Replace INPUT_PATH with the folder to watch. Behavior depends on what changed:
1188
+
1189
+ - **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.
1190
+ - **Docs, papers, or images:** writes a `graphify-out/needs_update` flag and prints a notification to run `/graphify --update` (LLM semantic re-extraction required).
1191
+
1192
+ Debounce (default 3s): waits until file activity stops before triggering, so a wave of parallel agent writes doesn't trigger a rebuild per file.
1193
+
1194
+ Press Ctrl+C to stop.
1195
+
1196
+ 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.
1197
+
1198
+ ---
1199
+
1200
+ ## For git commit hook
1201
+
1202
+ 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.
1203
+
1204
+ ```bash
1205
+ graphify hook install # install
1206
+ graphify hook uninstall # remove
1207
+ graphify hook status # check
1208
+ ```
1209
+
1210
+ 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.
1211
+
1212
+ If a post-commit hook already exists, graphify appends to it rather than replacing it.
1213
+
1214
+ ---
1215
+
1216
+ ## For native CLAUDE.md integration
1217
+
1218
+ Run once per project to make graphify always-on in Claude Code sessions:
1219
+
1220
+ ```bash
1221
+ graphify claude install
1222
+ ```
1223
+
1224
+ 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.
1225
+
1226
+ ```bash
1227
+ graphify claude uninstall # remove the section
1228
+ ```
1229
+
1230
+ ---
1231
+
1232
+ ## Honesty Rules
1233
+
1234
+ - Never invent an edge. If unsure, use AMBIGUOUS.
1235
+ - Never skip the corpus check warning.
1236
+ - Always show token cost in the report.
1237
+ - Never hide cohesion scores behind symbols - show the raw number.
1238
+ - Never run HTML viz on a graph with more than 5,000 nodes without warning the user.