okstra 0.130.4 → 0.131.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +0 -1
- package/docs/architecture.md +2 -2
- package/docs/cli.md +1 -1
- package/docs/for-ai/README.md +0 -2
- package/docs/for-ai/skills/okstra-run.md +13 -2
- package/docs/for-ai/skills/okstra-setup.md +4 -1
- package/docs/project-structure-overview.md +5 -4
- package/docs/task-process/implementation-planning.md +13 -0
- package/docs/task-process/implementation.md +17 -2
- package/package.json +1 -1
- package/runtime/BUILD.json +2 -2
- package/runtime/agents/workers/report-writer-worker.md +7 -0
- package/runtime/bin/lib/okstra/usage.sh +4 -4
- package/runtime/prompts/lead/okstra-lead-contract.md +2 -2
- package/runtime/prompts/lead/plan-body-verification.md +26 -5
- package/runtime/prompts/lead/report-writer.md +6 -2
- package/runtime/prompts/profiles/_common-contract.md +2 -1
- package/runtime/prompts/profiles/_implementation-deliverable.md +6 -1
- package/runtime/prompts/profiles/_implementation-executor.md +2 -2
- package/runtime/prompts/profiles/_implementation-verifier.md +33 -10
- package/runtime/prompts/profiles/final-verification.md +21 -6
- package/runtime/prompts/profiles/implementation-planning.md +16 -4
- package/runtime/python/okstra_ctl/codex_dispatch.py +31 -0
- package/runtime/python/okstra_ctl/conformance.py +49 -11
- package/runtime/python/okstra_ctl/report_finalize.py +52 -1
- package/runtime/python/okstra_ctl/run.py +15 -3
- package/runtime/python/okstra_ctl/worker_prompt_contract.py +14 -6
- package/runtime/python/okstra_ctl/worker_prompt_policy.py +19 -1
- package/runtime/python/okstra_vendor/__init__.py +0 -44
- package/runtime/schemas/final-report-v1.0.schema.json +99 -5
- package/runtime/skills/okstra-run/SKILL.md +11 -4
- package/runtime/skills/okstra-setup/SKILL.md +3 -2
- package/runtime/skills/okstra-setup/references/project-config.md +16 -7
- package/runtime/templates/reports/final-report.template.md +15 -9
- package/runtime/templates/reports/i18n/en.json +1 -0
- package/runtime/templates/reports/i18n/ko.json +1 -0
- package/runtime/validators/lib/fixtures.sh +6 -0
- package/runtime/validators/validate-run.py +2019 -96
- package/src/cli-registry.mjs +0 -7
- package/src/commands/lifecycle/doctor.mjs +0 -9
- package/src/lib/skill-catalog.mjs +0 -1
- package/docs/for-ai/skills/okstra-graphify.md +0 -64
- package/runtime/python/okstra_ctl/graphify_cmd.py +0 -225
- package/runtime/python/okstra_vendor/graphify/.vendored-version +0 -1
- package/runtime/python/okstra_vendor/graphify/__init__.py +0 -28
- package/runtime/python/okstra_vendor/graphify/__main__.py +0 -1371
- package/runtime/python/okstra_vendor/graphify/analyze.py +0 -540
- package/runtime/python/okstra_vendor/graphify/benchmark.py +0 -129
- package/runtime/python/okstra_vendor/graphify/build.py +0 -107
- package/runtime/python/okstra_vendor/graphify/cache.py +0 -169
- package/runtime/python/okstra_vendor/graphify/cluster.py +0 -137
- package/runtime/python/okstra_vendor/graphify/detect.py +0 -510
- package/runtime/python/okstra_vendor/graphify/export.py +0 -1014
- package/runtime/python/okstra_vendor/graphify/extract.py +0 -3277
- package/runtime/python/okstra_vendor/graphify/hooks.py +0 -220
- package/runtime/python/okstra_vendor/graphify/ingest.py +0 -297
- package/runtime/python/okstra_vendor/graphify/manifest.py +0 -4
- package/runtime/python/okstra_vendor/graphify/report.py +0 -175
- package/runtime/python/okstra_vendor/graphify/security.py +0 -203
- package/runtime/python/okstra_vendor/graphify/serve.py +0 -373
- package/runtime/python/okstra_vendor/graphify/skill-aider.md +0 -1184
- package/runtime/python/okstra_vendor/graphify/skill-claw.md +0 -1184
- package/runtime/python/okstra_vendor/graphify/skill-codex.md +0 -1242
- package/runtime/python/okstra_vendor/graphify/skill-copilot.md +0 -1268
- package/runtime/python/okstra_vendor/graphify/skill-droid.md +0 -1239
- package/runtime/python/okstra_vendor/graphify/skill-kiro.md +0 -1183
- package/runtime/python/okstra_vendor/graphify/skill-opencode.md +0 -1238
- package/runtime/python/okstra_vendor/graphify/skill-trae.md +0 -1208
- package/runtime/python/okstra_vendor/graphify/skill-vscode.md +0 -253
- package/runtime/python/okstra_vendor/graphify/skill-windows.md +0 -1245
- package/runtime/python/okstra_vendor/graphify/skill.md +0 -1319
- package/runtime/python/okstra_vendor/graphify/transcribe.py +0 -182
- package/runtime/python/okstra_vendor/graphify/validate.py +0 -72
- package/runtime/python/okstra_vendor/graphify/watch.py +0 -188
- package/runtime/python/okstra_vendor/graphify/wiki.py +0 -214
- package/runtime/python/okstra_vendor/networkx/__init__.py +0 -62
- package/runtime/python/okstra_vendor/networkx/algorithms/__init__.py +0 -134
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/__init__.py +0 -26
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/clique.py +0 -259
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/clustering_coefficient.py +0 -71
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/connectivity.py +0 -412
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/density.py +0 -396
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/distance_measures.py +0 -150
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/dominating_set.py +0 -149
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/kcomponents.py +0 -369
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/matching.py +0 -44
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/maxcut.py +0 -143
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/ramsey.py +0 -53
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/steinertree.py +0 -265
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/traveling_salesman.py +0 -1508
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/treewidth.py +0 -255
- package/runtime/python/okstra_vendor/networkx/algorithms/approximation/vertex_cover.py +0 -83
- package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/__init__.py +0 -5
- package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/connectivity.py +0 -122
- package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/correlation.py +0 -302
- package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/mixing.py +0 -255
- package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/neighbor_degree.py +0 -160
- package/runtime/python/okstra_vendor/networkx/algorithms/assortativity/pairs.py +0 -127
- package/runtime/python/okstra_vendor/networkx/algorithms/asteroidal.py +0 -164
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/__init__.py +0 -88
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/basic.py +0 -322
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/centrality.py +0 -290
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/cluster.py +0 -289
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/covering.py +0 -57
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/edgelist.py +0 -360
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/extendability.py +0 -105
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/generators.py +0 -603
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/link_analysis.py +0 -316
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/matching.py +0 -590
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/matrix.py +0 -232
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/projection.py +0 -526
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/redundancy.py +0 -112
- package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/spectral.py +0 -69
- package/runtime/python/okstra_vendor/networkx/algorithms/boundary.py +0 -168
- package/runtime/python/okstra_vendor/networkx/algorithms/bridges.py +0 -205
- package/runtime/python/okstra_vendor/networkx/algorithms/broadcasting.py +0 -164
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/__init__.py +0 -20
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/betweenness.py +0 -591
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/betweenness_subset.py +0 -236
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/closeness.py +0 -282
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_betweenness.py +0 -364
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_betweenness_subset.py +0 -227
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_closeness.py +0 -96
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/degree_alg.py +0 -150
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/dispersion.py +0 -107
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/eigenvector.py +0 -357
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/flow_matrix.py +0 -130
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/group.py +0 -787
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/harmonic.py +0 -88
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/katz.py +0 -331
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/laplacian.py +0 -150
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/load.py +0 -200
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/percolation.py +0 -128
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/reaching.py +0 -209
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/second_order.py +0 -141
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/subgraph_alg.py +0 -361
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/trophic.py +0 -181
- package/runtime/python/okstra_vendor/networkx/algorithms/centrality/voterank_alg.py +0 -95
- package/runtime/python/okstra_vendor/networkx/algorithms/chains.py +0 -172
- package/runtime/python/okstra_vendor/networkx/algorithms/chordal.py +0 -443
- package/runtime/python/okstra_vendor/networkx/algorithms/clique.py +0 -818
- package/runtime/python/okstra_vendor/networkx/algorithms/cluster.py +0 -732
- package/runtime/python/okstra_vendor/networkx/algorithms/coloring/__init__.py +0 -4
- package/runtime/python/okstra_vendor/networkx/algorithms/coloring/equitable_coloring.py +0 -505
- package/runtime/python/okstra_vendor/networkx/algorithms/coloring/greedy_coloring.py +0 -565
- package/runtime/python/okstra_vendor/networkx/algorithms/communicability_alg.py +0 -163
- package/runtime/python/okstra_vendor/networkx/algorithms/community/__init__.py +0 -28
- package/runtime/python/okstra_vendor/networkx/algorithms/community/asyn_fluid.py +0 -153
- package/runtime/python/okstra_vendor/networkx/algorithms/community/bipartitions.py +0 -354
- package/runtime/python/okstra_vendor/networkx/algorithms/community/centrality.py +0 -171
- package/runtime/python/okstra_vendor/networkx/algorithms/community/community_utils.py +0 -30
- package/runtime/python/okstra_vendor/networkx/algorithms/community/divisive.py +0 -216
- package/runtime/python/okstra_vendor/networkx/algorithms/community/kclique.py +0 -79
- package/runtime/python/okstra_vendor/networkx/algorithms/community/label_propagation.py +0 -338
- package/runtime/python/okstra_vendor/networkx/algorithms/community/leiden.py +0 -162
- package/runtime/python/okstra_vendor/networkx/algorithms/community/local.py +0 -220
- package/runtime/python/okstra_vendor/networkx/algorithms/community/louvain.py +0 -384
- package/runtime/python/okstra_vendor/networkx/algorithms/community/lukes.py +0 -227
- package/runtime/python/okstra_vendor/networkx/algorithms/community/modularity_max.py +0 -452
- package/runtime/python/okstra_vendor/networkx/algorithms/community/quality.py +0 -347
- package/runtime/python/okstra_vendor/networkx/algorithms/components/__init__.py +0 -6
- package/runtime/python/okstra_vendor/networkx/algorithms/components/attracting.py +0 -115
- package/runtime/python/okstra_vendor/networkx/algorithms/components/biconnected.py +0 -394
- package/runtime/python/okstra_vendor/networkx/algorithms/components/connected.py +0 -282
- package/runtime/python/okstra_vendor/networkx/algorithms/components/semiconnected.py +0 -71
- package/runtime/python/okstra_vendor/networkx/algorithms/components/strongly_connected.py +0 -359
- package/runtime/python/okstra_vendor/networkx/algorithms/components/weakly_connected.py +0 -196
- package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/__init__.py +0 -11
- package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/connectivity.py +0 -811
- package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/cuts.py +0 -616
- package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/disjoint_paths.py +0 -408
- package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/edge_augmentation.py +0 -1270
- package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/edge_kcomponents.py +0 -592
- package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/kcomponents.py +0 -220
- package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/kcutsets.py +0 -235
- package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/stoerwagner.py +0 -152
- package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/utils.py +0 -88
- package/runtime/python/okstra_vendor/networkx/algorithms/core.py +0 -588
- package/runtime/python/okstra_vendor/networkx/algorithms/covering.py +0 -142
- package/runtime/python/okstra_vendor/networkx/algorithms/cuts.py +0 -416
- package/runtime/python/okstra_vendor/networkx/algorithms/cycles.py +0 -1234
- package/runtime/python/okstra_vendor/networkx/algorithms/d_separation.py +0 -677
- package/runtime/python/okstra_vendor/networkx/algorithms/dag.py +0 -1392
- package/runtime/python/okstra_vendor/networkx/algorithms/distance_measures.py +0 -1095
- package/runtime/python/okstra_vendor/networkx/algorithms/distance_regular.py +0 -272
- package/runtime/python/okstra_vendor/networkx/algorithms/dominance.py +0 -142
- package/runtime/python/okstra_vendor/networkx/algorithms/dominating.py +0 -268
- package/runtime/python/okstra_vendor/networkx/algorithms/efficiency_measures.py +0 -167
- package/runtime/python/okstra_vendor/networkx/algorithms/euler.py +0 -470
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/__init__.py +0 -11
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/boykovkolmogorov.py +0 -370
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/capacityscaling.py +0 -407
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/dinitz_alg.py +0 -238
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/edmondskarp.py +0 -241
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/gomory_hu.py +0 -178
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/maxflow.py +0 -611
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/mincost.py +0 -356
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/networksimplex.py +0 -662
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/preflowpush.py +0 -425
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/shortestaugmentingpath.py +0 -300
- package/runtime/python/okstra_vendor/networkx/algorithms/flow/utils.py +0 -194
- package/runtime/python/okstra_vendor/networkx/algorithms/graph_hashing.py +0 -435
- package/runtime/python/okstra_vendor/networkx/algorithms/graphical.py +0 -483
- package/runtime/python/okstra_vendor/networkx/algorithms/hierarchy.py +0 -57
- package/runtime/python/okstra_vendor/networkx/algorithms/hybrid.py +0 -196
- package/runtime/python/okstra_vendor/networkx/algorithms/isolate.py +0 -107
- package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/__init__.py +0 -7
- package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/ismags.py +0 -1306
- package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/isomorph.py +0 -336
- package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/isomorphvf2.py +0 -1262
- package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/matchhelpers.py +0 -352
- package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/temporalisomorphvf2.py +0 -308
- package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/tree_isomorphism.py +0 -264
- package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/vf2pp.py +0 -1102
- package/runtime/python/okstra_vendor/networkx/algorithms/isomorphism/vf2userfunc.py +0 -192
- package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/__init__.py +0 -2
- package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/hits_alg.py +0 -337
- package/runtime/python/okstra_vendor/networkx/algorithms/link_analysis/pagerank_alg.py +0 -498
- package/runtime/python/okstra_vendor/networkx/algorithms/link_prediction.py +0 -687
- package/runtime/python/okstra_vendor/networkx/algorithms/lowest_common_ancestors.py +0 -280
- package/runtime/python/okstra_vendor/networkx/algorithms/matching.py +0 -1148
- package/runtime/python/okstra_vendor/networkx/algorithms/minors/__init__.py +0 -27
- package/runtime/python/okstra_vendor/networkx/algorithms/minors/contraction.py +0 -738
- package/runtime/python/okstra_vendor/networkx/algorithms/mis.py +0 -78
- package/runtime/python/okstra_vendor/networkx/algorithms/moral.py +0 -59
- package/runtime/python/okstra_vendor/networkx/algorithms/node_classification.py +0 -219
- package/runtime/python/okstra_vendor/networkx/algorithms/non_randomness.py +0 -155
- package/runtime/python/okstra_vendor/networkx/algorithms/operators/__init__.py +0 -4
- package/runtime/python/okstra_vendor/networkx/algorithms/operators/all.py +0 -324
- package/runtime/python/okstra_vendor/networkx/algorithms/operators/binary.py +0 -468
- package/runtime/python/okstra_vendor/networkx/algorithms/operators/product.py +0 -633
- package/runtime/python/okstra_vendor/networkx/algorithms/operators/unary.py +0 -77
- package/runtime/python/okstra_vendor/networkx/algorithms/perfect_graph.py +0 -73
- package/runtime/python/okstra_vendor/networkx/algorithms/planar_drawing.py +0 -464
- package/runtime/python/okstra_vendor/networkx/algorithms/planarity.py +0 -1463
- package/runtime/python/okstra_vendor/networkx/algorithms/polynomials.py +0 -306
- package/runtime/python/okstra_vendor/networkx/algorithms/reciprocity.py +0 -98
- package/runtime/python/okstra_vendor/networkx/algorithms/regular.py +0 -167
- package/runtime/python/okstra_vendor/networkx/algorithms/richclub.py +0 -138
- package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/__init__.py +0 -5
- package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/astar.py +0 -239
- package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/dense.py +0 -264
- package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/generic.py +0 -716
- package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/unweighted.py +0 -625
- package/runtime/python/okstra_vendor/networkx/algorithms/shortest_paths/weighted.py +0 -2542
- package/runtime/python/okstra_vendor/networkx/algorithms/similarity.py +0 -2107
- package/runtime/python/okstra_vendor/networkx/algorithms/simple_paths.py +0 -966
- package/runtime/python/okstra_vendor/networkx/algorithms/smallworld.py +0 -404
- package/runtime/python/okstra_vendor/networkx/algorithms/smetric.py +0 -30
- package/runtime/python/okstra_vendor/networkx/algorithms/sparsifiers.py +0 -296
- package/runtime/python/okstra_vendor/networkx/algorithms/structuralholes.py +0 -374
- package/runtime/python/okstra_vendor/networkx/algorithms/summarization.py +0 -564
- package/runtime/python/okstra_vendor/networkx/algorithms/swap.py +0 -406
- package/runtime/python/okstra_vendor/networkx/algorithms/threshold.py +0 -981
- package/runtime/python/okstra_vendor/networkx/algorithms/time_dependent.py +0 -142
- package/runtime/python/okstra_vendor/networkx/algorithms/tournament.py +0 -406
- package/runtime/python/okstra_vendor/networkx/algorithms/traversal/__init__.py +0 -5
- package/runtime/python/okstra_vendor/networkx/algorithms/traversal/beamsearch.py +0 -90
- package/runtime/python/okstra_vendor/networkx/algorithms/traversal/breadth_first_search.py +0 -576
- package/runtime/python/okstra_vendor/networkx/algorithms/traversal/depth_first_search.py +0 -529
- package/runtime/python/okstra_vendor/networkx/algorithms/traversal/edgebfs.py +0 -185
- package/runtime/python/okstra_vendor/networkx/algorithms/traversal/edgedfs.py +0 -182
- package/runtime/python/okstra_vendor/networkx/algorithms/tree/__init__.py +0 -7
- package/runtime/python/okstra_vendor/networkx/algorithms/tree/branchings.py +0 -1042
- package/runtime/python/okstra_vendor/networkx/algorithms/tree/coding.py +0 -413
- package/runtime/python/okstra_vendor/networkx/algorithms/tree/decomposition.py +0 -88
- package/runtime/python/okstra_vendor/networkx/algorithms/tree/distance_measures.py +0 -219
- package/runtime/python/okstra_vendor/networkx/algorithms/tree/mst.py +0 -1281
- package/runtime/python/okstra_vendor/networkx/algorithms/tree/operations.py +0 -106
- package/runtime/python/okstra_vendor/networkx/algorithms/tree/recognition.py +0 -273
- package/runtime/python/okstra_vendor/networkx/algorithms/triads.py +0 -500
- package/runtime/python/okstra_vendor/networkx/algorithms/vitality.py +0 -76
- package/runtime/python/okstra_vendor/networkx/algorithms/voronoi.py +0 -86
- package/runtime/python/okstra_vendor/networkx/algorithms/walks.py +0 -77
- package/runtime/python/okstra_vendor/networkx/algorithms/wiener.py +0 -278
- package/runtime/python/okstra_vendor/networkx/classes/__init__.py +0 -13
- package/runtime/python/okstra_vendor/networkx/classes/coreviews.py +0 -435
- package/runtime/python/okstra_vendor/networkx/classes/digraph.py +0 -1363
- package/runtime/python/okstra_vendor/networkx/classes/filters.py +0 -95
- package/runtime/python/okstra_vendor/networkx/classes/function.py +0 -1549
- package/runtime/python/okstra_vendor/networkx/classes/graph.py +0 -2082
- package/runtime/python/okstra_vendor/networkx/classes/graphviews.py +0 -269
- package/runtime/python/okstra_vendor/networkx/classes/multidigraph.py +0 -977
- package/runtime/python/okstra_vendor/networkx/classes/multigraph.py +0 -1294
- package/runtime/python/okstra_vendor/networkx/classes/reportviews.py +0 -1447
- package/runtime/python/okstra_vendor/networkx/convert.py +0 -502
- package/runtime/python/okstra_vendor/networkx/convert_matrix.py +0 -1314
- package/runtime/python/okstra_vendor/networkx/drawing/__init__.py +0 -7
- package/runtime/python/okstra_vendor/networkx/drawing/layout.py +0 -2036
- package/runtime/python/okstra_vendor/networkx/drawing/nx_agraph.py +0 -470
- package/runtime/python/okstra_vendor/networkx/drawing/nx_latex.py +0 -570
- package/runtime/python/okstra_vendor/networkx/drawing/nx_pydot.py +0 -361
- package/runtime/python/okstra_vendor/networkx/drawing/nx_pylab.py +0 -2978
- package/runtime/python/okstra_vendor/networkx/exception.py +0 -131
- package/runtime/python/okstra_vendor/networkx/generators/__init__.py +0 -34
- package/runtime/python/okstra_vendor/networkx/generators/atlas.dat.gz +0 -0
- package/runtime/python/okstra_vendor/networkx/generators/atlas.py +0 -227
- package/runtime/python/okstra_vendor/networkx/generators/classic.py +0 -1091
- package/runtime/python/okstra_vendor/networkx/generators/cographs.py +0 -68
- package/runtime/python/okstra_vendor/networkx/generators/community.py +0 -1070
- package/runtime/python/okstra_vendor/networkx/generators/degree_seq.py +0 -886
- package/runtime/python/okstra_vendor/networkx/generators/directed.py +0 -572
- package/runtime/python/okstra_vendor/networkx/generators/duplication.py +0 -174
- package/runtime/python/okstra_vendor/networkx/generators/ego.py +0 -66
- package/runtime/python/okstra_vendor/networkx/generators/expanders.py +0 -499
- package/runtime/python/okstra_vendor/networkx/generators/geometric.py +0 -1037
- package/runtime/python/okstra_vendor/networkx/generators/harary_graph.py +0 -163
- package/runtime/python/okstra_vendor/networkx/generators/internet_as_graphs.py +0 -443
- package/runtime/python/okstra_vendor/networkx/generators/intersection.py +0 -125
- package/runtime/python/okstra_vendor/networkx/generators/interval_graph.py +0 -70
- package/runtime/python/okstra_vendor/networkx/generators/joint_degree_seq.py +0 -664
- package/runtime/python/okstra_vendor/networkx/generators/lattice.py +0 -405
- package/runtime/python/okstra_vendor/networkx/generators/line.py +0 -501
- package/runtime/python/okstra_vendor/networkx/generators/mycielski.py +0 -110
- package/runtime/python/okstra_vendor/networkx/generators/nonisomorphic_trees.py +0 -259
- package/runtime/python/okstra_vendor/networkx/generators/random_clustered.py +0 -117
- package/runtime/python/okstra_vendor/networkx/generators/random_graphs.py +0 -1416
- package/runtime/python/okstra_vendor/networkx/generators/small.py +0 -1070
- package/runtime/python/okstra_vendor/networkx/generators/social.py +0 -554
- package/runtime/python/okstra_vendor/networkx/generators/spectral_graph_forge.py +0 -120
- package/runtime/python/okstra_vendor/networkx/generators/stochastic.py +0 -54
- package/runtime/python/okstra_vendor/networkx/generators/sudoku.py +0 -131
- package/runtime/python/okstra_vendor/networkx/generators/time_series.py +0 -74
- package/runtime/python/okstra_vendor/networkx/generators/trees.py +0 -1070
- package/runtime/python/okstra_vendor/networkx/generators/triads.py +0 -94
- package/runtime/python/okstra_vendor/networkx/lazy_imports.py +0 -188
- package/runtime/python/okstra_vendor/networkx/linalg/__init__.py +0 -13
- package/runtime/python/okstra_vendor/networkx/linalg/algebraicconnectivity.py +0 -650
- package/runtime/python/okstra_vendor/networkx/linalg/attrmatrix.py +0 -466
- package/runtime/python/okstra_vendor/networkx/linalg/bethehessianmatrix.py +0 -77
- package/runtime/python/okstra_vendor/networkx/linalg/graphmatrix.py +0 -168
- package/runtime/python/okstra_vendor/networkx/linalg/laplacianmatrix.py +0 -512
- package/runtime/python/okstra_vendor/networkx/linalg/modularitymatrix.py +0 -166
- package/runtime/python/okstra_vendor/networkx/linalg/spectrum.py +0 -186
- package/runtime/python/okstra_vendor/networkx/readwrite/__init__.py +0 -17
- package/runtime/python/okstra_vendor/networkx/readwrite/adjlist.py +0 -330
- package/runtime/python/okstra_vendor/networkx/readwrite/edgelist.py +0 -489
- package/runtime/python/okstra_vendor/networkx/readwrite/gexf.py +0 -1084
- package/runtime/python/okstra_vendor/networkx/readwrite/gml.py +0 -879
- package/runtime/python/okstra_vendor/networkx/readwrite/graph6.py +0 -427
- package/runtime/python/okstra_vendor/networkx/readwrite/graphml.py +0 -1053
- package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/__init__.py +0 -19
- package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/adjacency.py +0 -156
- package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/cytoscape.py +0 -190
- package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/node_link.py +0 -261
- package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tree.py +0 -137
- package/runtime/python/okstra_vendor/networkx/readwrite/leda.py +0 -108
- package/runtime/python/okstra_vendor/networkx/readwrite/multiline_adjlist.py +0 -393
- package/runtime/python/okstra_vendor/networkx/readwrite/p2g.py +0 -113
- package/runtime/python/okstra_vendor/networkx/readwrite/pajek.py +0 -286
- package/runtime/python/okstra_vendor/networkx/readwrite/sparse6.py +0 -379
- package/runtime/python/okstra_vendor/networkx/readwrite/text.py +0 -851
- package/runtime/python/okstra_vendor/networkx/relabel.py +0 -285
- package/runtime/python/okstra_vendor/networkx/utils/__init__.py +0 -8
- package/runtime/python/okstra_vendor/networkx/utils/backends.py +0 -2171
- package/runtime/python/okstra_vendor/networkx/utils/configs.py +0 -396
- package/runtime/python/okstra_vendor/networkx/utils/decorators.py +0 -1233
- package/runtime/python/okstra_vendor/networkx/utils/heaps.py +0 -338
- package/runtime/python/okstra_vendor/networkx/utils/mapped_queue.py +0 -297
- package/runtime/python/okstra_vendor/networkx/utils/misc.py +0 -703
- package/runtime/python/okstra_vendor/networkx/utils/random_sequence.py +0 -198
- package/runtime/python/okstra_vendor/networkx/utils/rcm.py +0 -159
- package/runtime/python/okstra_vendor/networkx/utils/union_find.py +0 -106
- package/runtime/skills/okstra-graphify/SKILL.md +0 -169
- package/src/commands/graphify.mjs +0 -32
|
@@ -1,379 +0,0 @@
|
|
|
1
|
-
# Original author: D. Eppstein, UC Irvine, August 12, 2003.
|
|
2
|
-
# The original code at https://www.ics.uci.edu/~eppstein/PADS/ is public domain.
|
|
3
|
-
"""Functions for reading and writing graphs in the *sparse6* format.
|
|
4
|
-
|
|
5
|
-
The *sparse6* file format is a space-efficient format for large sparse
|
|
6
|
-
graphs. For small graphs or large dense graphs, use the *graph6* file
|
|
7
|
-
format.
|
|
8
|
-
|
|
9
|
-
For more information, see the `sparse6`_ homepage.
|
|
10
|
-
|
|
11
|
-
.. _sparse6: https://users.cecs.anu.edu.au/~bdm/data/formats.html
|
|
12
|
-
|
|
13
|
-
"""
|
|
14
|
-
|
|
15
|
-
import networkx as nx
|
|
16
|
-
from networkx.exception import NetworkXError
|
|
17
|
-
from networkx.readwrite.graph6 import data_to_n, n_to_data
|
|
18
|
-
from networkx.utils import not_implemented_for, open_file
|
|
19
|
-
|
|
20
|
-
__all__ = ["from_sparse6_bytes", "read_sparse6", "to_sparse6_bytes", "write_sparse6"]
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
def _generate_sparse6_bytes(G, nodes, header):
|
|
24
|
-
"""Yield bytes in the sparse6 encoding of a graph.
|
|
25
|
-
|
|
26
|
-
`G` is an undirected simple graph. `nodes` is the list of nodes for
|
|
27
|
-
which the node-induced subgraph will be encoded; if `nodes` is the
|
|
28
|
-
list of all nodes in the graph, the entire graph will be
|
|
29
|
-
encoded. `header` is a Boolean that specifies whether to generate
|
|
30
|
-
the header ``b'>>sparse6<<'`` before the remaining data.
|
|
31
|
-
|
|
32
|
-
This function generates `bytes` objects in the following order:
|
|
33
|
-
|
|
34
|
-
1. the header (if requested),
|
|
35
|
-
2. the encoding of the number of nodes,
|
|
36
|
-
3. each character, one-at-a-time, in the encoding of the requested
|
|
37
|
-
node-induced subgraph,
|
|
38
|
-
4. a newline character.
|
|
39
|
-
|
|
40
|
-
This function raises :exc:`ValueError` if the graph is too large for
|
|
41
|
-
the graph6 format (that is, greater than ``2 ** 36`` nodes).
|
|
42
|
-
|
|
43
|
-
"""
|
|
44
|
-
n = len(G)
|
|
45
|
-
if n >= 2**36:
|
|
46
|
-
raise ValueError(
|
|
47
|
-
"sparse6 is only defined if number of nodes is less than 2 ** 36"
|
|
48
|
-
)
|
|
49
|
-
if header:
|
|
50
|
-
yield b">>sparse6<<"
|
|
51
|
-
yield b":"
|
|
52
|
-
for d in n_to_data(n):
|
|
53
|
-
yield str.encode(chr(d + 63))
|
|
54
|
-
|
|
55
|
-
k = 1
|
|
56
|
-
while 1 << k < n:
|
|
57
|
-
k += 1
|
|
58
|
-
|
|
59
|
-
def enc(x):
|
|
60
|
-
"""Big endian k-bit encoding of x"""
|
|
61
|
-
return [1 if (x & 1 << (k - 1 - i)) else 0 for i in range(k)]
|
|
62
|
-
|
|
63
|
-
edges = sorted((max(u, v), min(u, v)) for u, v in G.edges())
|
|
64
|
-
bits = []
|
|
65
|
-
curv = 0
|
|
66
|
-
for v, u in edges:
|
|
67
|
-
if v == curv: # current vertex edge
|
|
68
|
-
bits.append(0)
|
|
69
|
-
bits.extend(enc(u))
|
|
70
|
-
elif v == curv + 1: # next vertex edge
|
|
71
|
-
curv += 1
|
|
72
|
-
bits.append(1)
|
|
73
|
-
bits.extend(enc(u))
|
|
74
|
-
else: # skip to vertex v and then add edge to u
|
|
75
|
-
curv = v
|
|
76
|
-
bits.append(1)
|
|
77
|
-
bits.extend(enc(v))
|
|
78
|
-
bits.append(0)
|
|
79
|
-
bits.extend(enc(u))
|
|
80
|
-
if k < 6 and n == (1 << k) and ((-len(bits)) % 6) >= k and curv < (n - 1):
|
|
81
|
-
# Padding special case: small k, n=2^k,
|
|
82
|
-
# more than k bits of padding needed,
|
|
83
|
-
# current vertex is not (n-1) --
|
|
84
|
-
# appending 1111... would add a loop on (n-1)
|
|
85
|
-
bits.append(0)
|
|
86
|
-
bits.extend([1] * ((-len(bits)) % 6))
|
|
87
|
-
else:
|
|
88
|
-
bits.extend([1] * ((-len(bits)) % 6))
|
|
89
|
-
|
|
90
|
-
data = [
|
|
91
|
-
(bits[i + 0] << 5)
|
|
92
|
-
+ (bits[i + 1] << 4)
|
|
93
|
-
+ (bits[i + 2] << 3)
|
|
94
|
-
+ (bits[i + 3] << 2)
|
|
95
|
-
+ (bits[i + 4] << 1)
|
|
96
|
-
+ (bits[i + 5] << 0)
|
|
97
|
-
for i in range(0, len(bits), 6)
|
|
98
|
-
]
|
|
99
|
-
|
|
100
|
-
for d in data:
|
|
101
|
-
yield str.encode(chr(d + 63))
|
|
102
|
-
yield b"\n"
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
@nx._dispatchable(graphs=None, returns_graph=True)
|
|
106
|
-
def from_sparse6_bytes(string):
|
|
107
|
-
"""Read an undirected graph in sparse6 format from string.
|
|
108
|
-
|
|
109
|
-
Parameters
|
|
110
|
-
----------
|
|
111
|
-
string : string
|
|
112
|
-
Data in sparse6 format
|
|
113
|
-
|
|
114
|
-
Returns
|
|
115
|
-
-------
|
|
116
|
-
G : Graph
|
|
117
|
-
|
|
118
|
-
Raises
|
|
119
|
-
------
|
|
120
|
-
NetworkXError
|
|
121
|
-
If the string is unable to be parsed in sparse6 format
|
|
122
|
-
|
|
123
|
-
Examples
|
|
124
|
-
--------
|
|
125
|
-
>>> G = nx.from_sparse6_bytes(b":A_")
|
|
126
|
-
>>> sorted(G.edges())
|
|
127
|
-
[(0, 1), (0, 1), (0, 1)]
|
|
128
|
-
|
|
129
|
-
See Also
|
|
130
|
-
--------
|
|
131
|
-
read_sparse6, write_sparse6
|
|
132
|
-
|
|
133
|
-
References
|
|
134
|
-
----------
|
|
135
|
-
.. [1] Sparse6 specification
|
|
136
|
-
<https://users.cecs.anu.edu.au/~bdm/data/formats.html>
|
|
137
|
-
|
|
138
|
-
"""
|
|
139
|
-
if string.startswith(b">>sparse6<<"):
|
|
140
|
-
string = string[11:]
|
|
141
|
-
if not string.startswith(b":"):
|
|
142
|
-
raise NetworkXError("Expected leading colon in sparse6")
|
|
143
|
-
|
|
144
|
-
chars = [c - 63 for c in string[1:]]
|
|
145
|
-
n, data = data_to_n(chars)
|
|
146
|
-
k = 1
|
|
147
|
-
while 1 << k < n:
|
|
148
|
-
k += 1
|
|
149
|
-
|
|
150
|
-
def parseData():
|
|
151
|
-
"""Returns stream of pairs b[i], x[i] for sparse6 format."""
|
|
152
|
-
chunks = iter(data)
|
|
153
|
-
d = None # partial data word
|
|
154
|
-
dLen = 0 # how many unparsed bits are left in d
|
|
155
|
-
|
|
156
|
-
while 1:
|
|
157
|
-
if dLen < 1:
|
|
158
|
-
try:
|
|
159
|
-
d = next(chunks)
|
|
160
|
-
except StopIteration:
|
|
161
|
-
return
|
|
162
|
-
dLen = 6
|
|
163
|
-
dLen -= 1
|
|
164
|
-
b = (d >> dLen) & 1 # grab top remaining bit
|
|
165
|
-
|
|
166
|
-
x = d & ((1 << dLen) - 1) # partially built up value of x
|
|
167
|
-
xLen = dLen # how many bits included so far in x
|
|
168
|
-
while xLen < k: # now grab full chunks until we have enough
|
|
169
|
-
try:
|
|
170
|
-
d = next(chunks)
|
|
171
|
-
except StopIteration:
|
|
172
|
-
return
|
|
173
|
-
dLen = 6
|
|
174
|
-
x = (x << 6) + d
|
|
175
|
-
xLen += 6
|
|
176
|
-
x = x >> (xLen - k) # shift back the extra bits
|
|
177
|
-
dLen = xLen - k
|
|
178
|
-
yield b, x
|
|
179
|
-
|
|
180
|
-
v = 0
|
|
181
|
-
|
|
182
|
-
G = nx.MultiGraph()
|
|
183
|
-
G.add_nodes_from(range(n))
|
|
184
|
-
|
|
185
|
-
multigraph = False
|
|
186
|
-
for b, x in parseData():
|
|
187
|
-
if b == 1:
|
|
188
|
-
v += 1
|
|
189
|
-
# padding with ones can cause overlarge number here
|
|
190
|
-
if x >= n or v >= n:
|
|
191
|
-
break
|
|
192
|
-
elif x > v:
|
|
193
|
-
v = x
|
|
194
|
-
else:
|
|
195
|
-
if G.has_edge(x, v):
|
|
196
|
-
multigraph = True
|
|
197
|
-
G.add_edge(x, v)
|
|
198
|
-
if not multigraph:
|
|
199
|
-
G = nx.Graph(G)
|
|
200
|
-
return G
|
|
201
|
-
|
|
202
|
-
|
|
203
|
-
def to_sparse6_bytes(G, nodes=None, header=True):
|
|
204
|
-
"""Convert an undirected graph to bytes in sparse6 format.
|
|
205
|
-
|
|
206
|
-
Parameters
|
|
207
|
-
----------
|
|
208
|
-
G : Graph (undirected)
|
|
209
|
-
|
|
210
|
-
nodes: list or iterable
|
|
211
|
-
Nodes are labeled 0...n-1 in the order provided. If None the ordering
|
|
212
|
-
given by ``G.nodes()`` is used.
|
|
213
|
-
|
|
214
|
-
header: bool
|
|
215
|
-
If True add '>>sparse6<<' bytes to head of data.
|
|
216
|
-
|
|
217
|
-
Raises
|
|
218
|
-
------
|
|
219
|
-
NetworkXNotImplemented
|
|
220
|
-
If the graph is directed.
|
|
221
|
-
|
|
222
|
-
ValueError
|
|
223
|
-
If the graph has at least ``2 ** 36`` nodes; the sparse6 format
|
|
224
|
-
is only defined for graphs of order less than ``2 ** 36``.
|
|
225
|
-
|
|
226
|
-
Examples
|
|
227
|
-
--------
|
|
228
|
-
>>> nx.to_sparse6_bytes(nx.path_graph(2))
|
|
229
|
-
b'>>sparse6<<:An\\n'
|
|
230
|
-
|
|
231
|
-
See Also
|
|
232
|
-
--------
|
|
233
|
-
to_sparse6_bytes, read_sparse6, write_sparse6_bytes
|
|
234
|
-
|
|
235
|
-
Notes
|
|
236
|
-
-----
|
|
237
|
-
The returned bytes end with a newline character.
|
|
238
|
-
|
|
239
|
-
The format does not support edge or node labels.
|
|
240
|
-
|
|
241
|
-
References
|
|
242
|
-
----------
|
|
243
|
-
.. [1] Graph6 specification
|
|
244
|
-
<https://users.cecs.anu.edu.au/~bdm/data/formats.html>
|
|
245
|
-
|
|
246
|
-
"""
|
|
247
|
-
if nodes is not None:
|
|
248
|
-
G = G.subgraph(nodes)
|
|
249
|
-
G = nx.convert_node_labels_to_integers(G, ordering="sorted")
|
|
250
|
-
return b"".join(_generate_sparse6_bytes(G, nodes, header))
|
|
251
|
-
|
|
252
|
-
|
|
253
|
-
@open_file(0, mode="rb")
|
|
254
|
-
@nx._dispatchable(graphs=None, returns_graph=True)
|
|
255
|
-
def read_sparse6(path):
|
|
256
|
-
"""Read an undirected graph in sparse6 format from path.
|
|
257
|
-
|
|
258
|
-
Parameters
|
|
259
|
-
----------
|
|
260
|
-
path : file or string
|
|
261
|
-
Filename or file handle to read.
|
|
262
|
-
Filenames ending in .gz or .bz2 will be decompressed.
|
|
263
|
-
|
|
264
|
-
Returns
|
|
265
|
-
-------
|
|
266
|
-
G : Graph/Multigraph or list of Graphs/MultiGraphs
|
|
267
|
-
If the file contains multiple lines then a list of graphs is returned
|
|
268
|
-
|
|
269
|
-
Raises
|
|
270
|
-
------
|
|
271
|
-
NetworkXError
|
|
272
|
-
If the string is unable to be parsed in sparse6 format
|
|
273
|
-
|
|
274
|
-
Examples
|
|
275
|
-
--------
|
|
276
|
-
You can read a sparse6 file by giving the path to the file::
|
|
277
|
-
|
|
278
|
-
>>> import tempfile
|
|
279
|
-
>>> with tempfile.NamedTemporaryFile(delete=False) as f:
|
|
280
|
-
... _ = f.write(b">>sparse6<<:An\\n")
|
|
281
|
-
... _ = f.seek(0)
|
|
282
|
-
... G = nx.read_sparse6(f.name)
|
|
283
|
-
>>> list(G.edges())
|
|
284
|
-
[(0, 1)]
|
|
285
|
-
|
|
286
|
-
You can also read a sparse6 file by giving an open file-like object::
|
|
287
|
-
|
|
288
|
-
>>> import tempfile
|
|
289
|
-
>>> with tempfile.NamedTemporaryFile() as f:
|
|
290
|
-
... _ = f.write(b">>sparse6<<:An\\n")
|
|
291
|
-
... _ = f.seek(0)
|
|
292
|
-
... G = nx.read_sparse6(f)
|
|
293
|
-
>>> list(G.edges())
|
|
294
|
-
[(0, 1)]
|
|
295
|
-
|
|
296
|
-
See Also
|
|
297
|
-
--------
|
|
298
|
-
read_sparse6, from_sparse6_bytes
|
|
299
|
-
|
|
300
|
-
References
|
|
301
|
-
----------
|
|
302
|
-
.. [1] Sparse6 specification
|
|
303
|
-
<https://users.cecs.anu.edu.au/~bdm/data/formats.html>
|
|
304
|
-
|
|
305
|
-
"""
|
|
306
|
-
glist = []
|
|
307
|
-
for line in path:
|
|
308
|
-
line = line.strip()
|
|
309
|
-
if not len(line):
|
|
310
|
-
continue
|
|
311
|
-
glist.append(from_sparse6_bytes(line))
|
|
312
|
-
if len(glist) == 1:
|
|
313
|
-
return glist[0]
|
|
314
|
-
else:
|
|
315
|
-
return glist
|
|
316
|
-
|
|
317
|
-
|
|
318
|
-
@not_implemented_for("directed")
|
|
319
|
-
@open_file(1, mode="wb")
|
|
320
|
-
def write_sparse6(G, path, nodes=None, header=True):
|
|
321
|
-
"""Write graph G to given path in sparse6 format.
|
|
322
|
-
|
|
323
|
-
Parameters
|
|
324
|
-
----------
|
|
325
|
-
G : Graph (undirected)
|
|
326
|
-
|
|
327
|
-
path : file or string
|
|
328
|
-
File or filename to write.
|
|
329
|
-
Filenames ending in .gz or .bz2 will be compressed.
|
|
330
|
-
|
|
331
|
-
nodes: list or iterable
|
|
332
|
-
Nodes are labeled 0...n-1 in the order provided. If None the ordering
|
|
333
|
-
given by G.nodes() is used.
|
|
334
|
-
|
|
335
|
-
header: bool
|
|
336
|
-
If True add '>>sparse6<<' string to head of data
|
|
337
|
-
|
|
338
|
-
Raises
|
|
339
|
-
------
|
|
340
|
-
NetworkXError
|
|
341
|
-
If the graph is directed
|
|
342
|
-
|
|
343
|
-
Examples
|
|
344
|
-
--------
|
|
345
|
-
You can write a sparse6 file by giving the path to the file::
|
|
346
|
-
|
|
347
|
-
>>> import tempfile
|
|
348
|
-
>>> with tempfile.NamedTemporaryFile(delete=False) as f:
|
|
349
|
-
... nx.write_sparse6(nx.path_graph(2), f.name)
|
|
350
|
-
... print(f.read())
|
|
351
|
-
b'>>sparse6<<:An\\n'
|
|
352
|
-
|
|
353
|
-
You can also write a sparse6 file by giving an open file-like object::
|
|
354
|
-
|
|
355
|
-
>>> with tempfile.NamedTemporaryFile() as f:
|
|
356
|
-
... nx.write_sparse6(nx.path_graph(2), f)
|
|
357
|
-
... _ = f.seek(0)
|
|
358
|
-
... print(f.read())
|
|
359
|
-
b'>>sparse6<<:An\\n'
|
|
360
|
-
|
|
361
|
-
See Also
|
|
362
|
-
--------
|
|
363
|
-
read_sparse6, from_sparse6_bytes
|
|
364
|
-
|
|
365
|
-
Notes
|
|
366
|
-
-----
|
|
367
|
-
The format does not support edge or node labels.
|
|
368
|
-
|
|
369
|
-
References
|
|
370
|
-
----------
|
|
371
|
-
.. [1] Sparse6 specification
|
|
372
|
-
<https://users.cecs.anu.edu.au/~bdm/data/formats.html>
|
|
373
|
-
|
|
374
|
-
"""
|
|
375
|
-
if nodes is not None:
|
|
376
|
-
G = G.subgraph(nodes)
|
|
377
|
-
G = nx.convert_node_labels_to_integers(G, ordering="sorted")
|
|
378
|
-
for b in _generate_sparse6_bytes(G, nodes, header):
|
|
379
|
-
path.write(b)
|