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