graphbox 1.2.1 → 1.3.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.
- package/README.md +98 -41
- package/dist/__tests__/integration/bipartite.integration.test.d.ts +9 -0
- package/dist/__tests__/integration/bipartite.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/chordal.integration.test.d.ts +9 -0
- package/dist/__tests__/integration/chordal.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/cliquewidth.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/cliquewidth.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/cograph.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/cograph.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/comparability.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/comparability.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/eulerian.integration.test.d.ts +9 -0
- package/dist/__tests__/integration/eulerian.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/hamiltonian.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/hamiltonian.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/helpers.d.ts +8 -0
- package/dist/__tests__/integration/helpers.d.ts.map +1 -0
- package/dist/__tests__/integration/interval.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/interval.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/modular.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/modular.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/pathwidth.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/pathwidth.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/perfect.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/perfect.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/permutation.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/permutation.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/planar.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/planar.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/ptolemaic.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/ptolemaic.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/quasiline.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/quasiline.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/regular.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/regular.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/split.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/split.integration.test.d.ts.map +1 -0
- package/dist/__tests__/integration/tree.integration.test.d.ts +8 -0
- package/dist/__tests__/integration/tree.integration.test.d.ts.map +1 -0
- package/dist/algorithms/analysis/connected-components.unit.test.d.ts +5 -0
- package/dist/algorithms/analysis/connected-components.unit.test.d.ts.map +1 -0
- package/dist/algorithms/analysis/cycle-detection.unit.test.d.ts +5 -0
- package/dist/algorithms/analysis/cycle-detection.unit.test.d.ts.map +1 -0
- package/dist/algorithms/analysis/scc.unit.test.d.ts +5 -0
- package/dist/algorithms/analysis/scc.unit.test.d.ts.map +1 -0
- package/dist/algorithms/analysis/topological-sort.unit.test.d.ts +5 -0
- package/dist/algorithms/analysis/topological-sort.unit.test.d.ts.map +1 -0
- package/dist/algorithms/clustering/infomap.unit.test.d.ts +5 -0
- package/dist/algorithms/clustering/infomap.unit.test.d.ts.map +1 -0
- package/dist/algorithms/clustering/label-propagation.unit.test.d.ts +5 -0
- package/dist/algorithms/clustering/label-propagation.unit.test.d.ts.map +1 -0
- package/dist/algorithms/clustering/leiden.unit.test.d.ts +5 -0
- package/dist/algorithms/clustering/leiden.unit.test.d.ts.map +1 -0
- package/dist/algorithms/clustering/louvain.d.ts +22 -6
- package/dist/algorithms/clustering/louvain.d.ts.map +1 -1
- package/dist/algorithms/clustering/louvain.unit.test.d.ts +5 -0
- package/dist/algorithms/clustering/louvain.unit.test.d.ts.map +1 -0
- package/dist/algorithms/decomposition/biconnected.unit.test.d.ts +2 -0
- package/dist/algorithms/decomposition/biconnected.unit.test.d.ts.map +1 -0
- package/dist/algorithms/decomposition/core-periphery.unit.test.d.ts +2 -0
- package/dist/algorithms/decomposition/core-periphery.unit.test.d.ts.map +1 -0
- package/dist/algorithms/decomposition/k-core.unit.test.d.ts +2 -0
- package/dist/algorithms/decomposition/k-core.unit.test.d.ts.map +1 -0
- package/dist/algorithms/extraction/filter.unit.test.d.ts +5 -0
- package/dist/algorithms/extraction/filter.unit.test.d.ts.map +1 -0
- package/dist/algorithms/extraction/forbidden-subgraphs.d.ts +211 -0
- package/dist/algorithms/extraction/forbidden-subgraphs.d.ts.map +1 -0
- package/dist/algorithms/extraction/motif.unit.test.d.ts +5 -0
- package/dist/algorithms/extraction/motif.unit.test.d.ts.map +1 -0
- package/dist/algorithms/extraction/path.unit.test.d.ts +5 -0
- package/dist/algorithms/extraction/path.unit.test.d.ts.map +1 -0
- package/dist/algorithms/extraction/subgraph.unit.test.d.ts +5 -0
- package/dist/algorithms/extraction/subgraph.unit.test.d.ts.map +1 -0
- package/dist/algorithms/extraction/truss.unit.test.d.ts +5 -0
- package/dist/algorithms/extraction/truss.unit.test.d.ts.map +1 -0
- package/dist/algorithms/extraction/validators.unit.test.d.ts +2 -0
- package/dist/algorithms/extraction/validators.unit.test.d.ts.map +1 -0
- package/dist/algorithms/graph/graph-adapter.d.ts.map +1 -1
- package/dist/algorithms/graph/graph-adapter.unit.test.d.ts +2 -0
- package/dist/algorithms/graph/graph-adapter.unit.test.d.ts.map +1 -0
- package/dist/algorithms/graph/graph.unit.test.d.ts +5 -0
- package/dist/algorithms/graph/graph.unit.test.d.ts.map +1 -0
- package/dist/algorithms/hierarchical/clustering.unit.test.d.ts +2 -0
- package/dist/algorithms/hierarchical/clustering.unit.test.d.ts.map +1 -0
- package/dist/algorithms/layout/hierarchical-layout.unit.test.d.ts +5 -0
- package/dist/algorithms/layout/hierarchical-layout.unit.test.d.ts.map +1 -0
- package/dist/algorithms/metrics/cluster-quality.unit.test.d.ts +5 -0
- package/dist/algorithms/metrics/cluster-quality.unit.test.d.ts.map +1 -0
- package/dist/algorithms/metrics/conductance.unit.test.d.ts +5 -0
- package/dist/algorithms/metrics/conductance.unit.test.d.ts.map +1 -0
- package/dist/algorithms/metrics/modularity.d.ts.map +1 -1
- package/dist/algorithms/metrics/modularity.unit.test.d.ts +5 -0
- package/dist/algorithms/metrics/modularity.unit.test.d.ts.map +1 -0
- package/dist/algorithms/partitioning/spectral.unit.test.d.ts +5 -0
- package/dist/algorithms/partitioning/spectral.unit.test.d.ts.map +1 -0
- package/dist/algorithms/pathfinding/dijkstra.unit.test.d.ts +5 -0
- package/dist/algorithms/pathfinding/dijkstra.unit.test.d.ts.map +1 -0
- package/dist/algorithms/pathfinding/mutual-information.unit.test.d.ts +2 -0
- package/dist/algorithms/pathfinding/mutual-information.unit.test.d.ts.map +1 -0
- package/dist/algorithms/pathfinding/path-ranking.d.ts.map +1 -1
- package/dist/algorithms/pathfinding/path-ranking.unit.test.d.ts +2 -0
- package/dist/algorithms/pathfinding/path-ranking.unit.test.d.ts.map +1 -0
- package/dist/algorithms/pathfinding/priority-queue.unit.test.d.ts +5 -0
- package/dist/algorithms/pathfinding/priority-queue.unit.test.d.ts.map +1 -0
- package/dist/algorithms/pathfinding/random-path-sampling.d.ts +31 -0
- package/dist/algorithms/pathfinding/random-path-sampling.d.ts.map +1 -0
- package/dist/algorithms/pathfinding/shortest-path-ranking.d.ts +28 -0
- package/dist/algorithms/pathfinding/shortest-path-ranking.d.ts.map +1 -0
- package/dist/algorithms/traversal/bidirectional-bfs.d.ts +15 -0
- package/dist/algorithms/traversal/bidirectional-bfs.d.ts.map +1 -1
- package/dist/algorithms/traversal/degree-prioritised-expansion-intersection.unit.test.d.ts +13 -0
- package/dist/algorithms/traversal/degree-prioritised-expansion-intersection.unit.test.d.ts.map +1 -0
- package/dist/algorithms/traversal/degree-prioritised-expansion.d.ts +34 -2
- package/dist/algorithms/traversal/degree-prioritised-expansion.d.ts.map +1 -1
- package/dist/algorithms/traversal/degree-prioritised-expansion.unit.test.d.ts +5 -0
- package/dist/algorithms/traversal/degree-prioritised-expansion.unit.test.d.ts.map +1 -0
- package/dist/algorithms/traversal/entropy-guided-expansion.d.ts +172 -0
- package/dist/algorithms/traversal/entropy-guided-expansion.d.ts.map +1 -0
- package/dist/algorithms/traversal/entropy-guided-expansion.unit.test.d.ts +2 -0
- package/dist/algorithms/traversal/entropy-guided-expansion.unit.test.d.ts.map +1 -0
- package/dist/algorithms/traversal/heterogeneity-aware-expansion.d.ts +199 -0
- package/dist/algorithms/traversal/heterogeneity-aware-expansion.d.ts.map +1 -0
- package/dist/algorithms/traversal/heterogeneity-aware-expansion.unit.test.d.ts +2 -0
- package/dist/algorithms/traversal/heterogeneity-aware-expansion.unit.test.d.ts.map +1 -0
- package/dist/algorithms/traversal/index.d.ts +14 -0
- package/dist/algorithms/traversal/index.d.ts.map +1 -1
- package/dist/algorithms/traversal/intelligent-delayed-termination.d.ts +221 -0
- package/dist/algorithms/traversal/intelligent-delayed-termination.d.ts.map +1 -0
- package/dist/algorithms/traversal/intelligent-delayed-termination.unit.test.d.ts +2 -0
- package/dist/algorithms/traversal/intelligent-delayed-termination.unit.test.d.ts.map +1 -0
- package/dist/algorithms/traversal/multi-frontier-adaptive-expansion.d.ts +245 -0
- package/dist/algorithms/traversal/multi-frontier-adaptive-expansion.d.ts.map +1 -0
- package/dist/algorithms/traversal/multi-frontier-adaptive-expansion.unit.test.d.ts +2 -0
- package/dist/algorithms/traversal/multi-frontier-adaptive-expansion.unit.test.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/frontier-state.d.ts +25 -0
- package/dist/algorithms/traversal/overlap-based/frontier-state.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/index.d.ts +71 -0
- package/dist/algorithms/traversal/overlap-based/index.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/overlap-based-expansion.d.ts +182 -0
- package/dist/algorithms/traversal/overlap-based/overlap-based-expansion.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/overlap-result.d.ts +82 -0
- package/dist/algorithms/traversal/overlap-based/overlap-result.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/between-graph/between-graph-strategy.d.ts +42 -0
- package/dist/algorithms/traversal/overlap-based/strategies/between-graph/between-graph-strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/between-graph/minimal-paths.strategy.d.ts +41 -0
- package/dist/algorithms/traversal/overlap-based/strategies/between-graph/minimal-paths.strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/between-graph/salience-preserving.strategy.d.ts +82 -0
- package/dist/algorithms/traversal/overlap-based/strategies/between-graph/salience-preserving.strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/between-graph/truncated-component.strategy.d.ts +59 -0
- package/dist/algorithms/traversal/overlap-based/strategies/between-graph/truncated-component.strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/n1-handling/coverage-threshold.strategy.d.ts +57 -0
- package/dist/algorithms/traversal/overlap-based/strategies/n1-handling/coverage-threshold.strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/n1-handling/n1-handling-strategy.d.ts +25 -0
- package/dist/algorithms/traversal/overlap-based/strategies/n1-handling/n1-handling-strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/overlap-detection/overlap-detection-strategy.d.ts +26 -0
- package/dist/algorithms/traversal/overlap-based/strategies/overlap-detection/overlap-detection-strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/overlap-detection/physical-meeting.strategy.d.ts +35 -0
- package/dist/algorithms/traversal/overlap-based/strategies/overlap-detection/physical-meeting.strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/overlap-detection/sphere-intersection.strategy.d.ts +69 -0
- package/dist/algorithms/traversal/overlap-based/strategies/overlap-detection/sphere-intersection.strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/overlap-detection/threshold-sharing.strategy.d.ts +72 -0
- package/dist/algorithms/traversal/overlap-based/strategies/overlap-detection/threshold-sharing.strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/termination/common-convergence.strategy.d.ts +45 -0
- package/dist/algorithms/traversal/overlap-based/strategies/termination/common-convergence.strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/termination/full-pairwise.strategy.d.ts +43 -0
- package/dist/algorithms/traversal/overlap-based/strategies/termination/full-pairwise.strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/termination/termination-strategy.d.ts +40 -0
- package/dist/algorithms/traversal/overlap-based/strategies/termination/termination-strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/overlap-based/strategies/termination/transitive-connectivity.strategy.d.ts +45 -0
- package/dist/algorithms/traversal/overlap-based/strategies/termination/transitive-connectivity.strategy.d.ts.map +1 -0
- package/dist/algorithms/traversal/path-preserving-expansion.d.ts +197 -0
- package/dist/algorithms/traversal/path-preserving-expansion.d.ts.map +1 -0
- package/dist/algorithms/traversal/priority-calculator.d.ts +135 -0
- package/dist/algorithms/traversal/priority-calculator.d.ts.map +1 -0
- package/dist/algorithms/traversal/priority-queue.d.ts +6 -0
- package/dist/algorithms/traversal/priority-queue.d.ts.map +1 -1
- package/dist/algorithms/traversal/retrospective-salience-expansion.d.ts +173 -0
- package/dist/algorithms/traversal/retrospective-salience-expansion.d.ts.map +1 -0
- package/dist/algorithms/traversal/retrospective-salience-expansion.unit.test.d.ts +5 -0
- package/dist/algorithms/traversal/retrospective-salience-expansion.unit.test.d.ts.map +1 -0
- package/dist/algorithms/traversal/salience-prioritised-expansion.d.ts +149 -0
- package/dist/algorithms/traversal/salience-prioritised-expansion.d.ts.map +1 -0
- package/dist/algorithms/types/clustering-types.d.ts +2 -2
- package/dist/algorithms/types/clustering-types.d.ts.map +1 -1
- package/dist/algorithms/utils/csr.d.ts.map +1 -1
- package/dist/algorithms/utils/csr.unit.test.d.ts +2 -0
- package/dist/algorithms/utils/csr.unit.test.d.ts.map +1 -0
- package/dist/algorithms/utils/type-guards.unit.test.d.ts +2 -0
- package/dist/algorithms/utils/type-guards.unit.test.d.ts.map +1 -0
- package/dist/algorithms/utils/validators.unit.test.d.ts +2 -0
- package/dist/algorithms/utils/validators.unit.test.d.ts.map +1 -0
- package/dist/analyzer/advanced-props.d.ts.map +1 -1
- package/dist/analyzer/advanced-props.unit.test.d.ts +5 -0
- package/dist/analyzer/advanced-props.unit.test.d.ts.map +1 -0
- package/dist/analyzer/advanced-structures.unit.test.d.ts +5 -0
- package/dist/analyzer/advanced-structures.unit.test.d.ts.map +1 -0
- package/dist/analyzer/connectivity.unit.test.d.ts +5 -0
- package/dist/analyzer/connectivity.unit.test.d.ts.map +1 -0
- package/dist/analyzer/core-props.unit.test.d.ts +5 -0
- package/dist/analyzer/core-props.unit.test.d.ts.map +1 -0
- package/dist/analyzer/forbidden-subgraph.d.ts +59 -0
- package/dist/analyzer/forbidden-subgraph.d.ts.map +1 -0
- package/dist/analyzer/geometric.d.ts +21 -0
- package/dist/analyzer/geometric.d.ts.map +1 -0
- package/dist/analyzer/geometric.unit.test.d.ts +5 -0
- package/dist/analyzer/geometric.unit.test.d.ts.map +1 -0
- package/dist/analyzer/helpers.d.ts +2 -0
- package/dist/analyzer/helpers.d.ts.map +1 -1
- package/dist/analyzer/helpers.unit.test.d.ts +9 -0
- package/dist/analyzer/helpers.unit.test.d.ts.map +1 -0
- package/dist/analyzer/intersection.d.ts +17 -0
- package/dist/analyzer/intersection.d.ts.map +1 -0
- package/dist/analyzer/main.d.ts +22 -0
- package/dist/analyzer/main.d.ts.map +1 -1
- package/dist/analyzer/main.unit.test.d.ts +5 -0
- package/dist/analyzer/main.unit.test.d.ts.map +1 -0
- package/dist/analyzer/path-props.unit.test.d.ts +5 -0
- package/dist/analyzer/path-props.unit.test.d.ts.map +1 -0
- package/dist/analyzer/perfect-variants.d.ts +49 -0
- package/dist/analyzer/perfect-variants.d.ts.map +1 -0
- package/dist/analyzer/perfect-variants.unit.test.d.ts +5 -0
- package/dist/analyzer/perfect-variants.unit.test.d.ts.map +1 -0
- package/dist/analyzer/predicates.d.ts +31 -3
- package/dist/analyzer/predicates.d.ts.map +1 -1
- package/dist/analyzer/predicates.unit.test.d.ts +5 -0
- package/dist/analyzer/predicates.unit.test.d.ts.map +1 -0
- package/dist/analyzer/probe.d.ts +15 -0
- package/dist/analyzer/probe.d.ts.map +1 -0
- package/dist/analyzer/spectral.unit.test.d.ts +5 -0
- package/dist/analyzer/spectral.unit.test.d.ts.map +1 -0
- package/dist/analyzer/structural.d.ts +13 -0
- package/dist/analyzer/structural.d.ts.map +1 -0
- package/dist/analyzer/structure.d.ts.map +1 -1
- package/dist/analyzer/structure.unit.test.d.ts +5 -0
- package/dist/analyzer/structure.unit.test.d.ts.map +1 -0
- package/dist/analyzer/width.d.ts +33 -0
- package/dist/analyzer/width.d.ts.map +1 -0
- package/dist/analyzer/width.unit.test.d.ts +5 -0
- package/dist/analyzer/width.unit.test.d.ts.map +1 -0
- package/dist/cli-commands/analyze.d.ts +30 -0
- package/dist/cli-commands/analyze.d.ts.map +1 -0
- package/dist/cli-commands/evaluate.d.ts +64 -0
- package/dist/cli-commands/evaluate.d.ts.map +1 -0
- package/dist/cli-commands/generate.d.ts +34 -0
- package/dist/cli-commands/generate.d.ts.map +1 -0
- package/dist/cli-commands/validate.d.ts +32 -0
- package/dist/cli-commands/validate.d.ts.map +1 -0
- package/dist/cli-utils/arg-parser.d.ts +55 -0
- package/dist/cli-utils/arg-parser.d.ts.map +1 -0
- package/dist/cli-utils/arg-parser.unit.test.d.ts +5 -0
- package/dist/cli-utils/arg-parser.unit.test.d.ts.map +1 -0
- package/dist/cli-utils/error-formatter.d.ts +27 -0
- package/dist/cli-utils/error-formatter.d.ts.map +1 -0
- package/dist/cli-utils/format-detection.d.ts +25 -0
- package/dist/cli-utils/format-detection.d.ts.map +1 -0
- package/dist/cli-utils/format-detection.unit.test.d.ts +5 -0
- package/dist/cli-utils/format-detection.unit.test.d.ts.map +1 -0
- package/dist/cli-utils/graph-converter.d.ts +32 -0
- package/dist/cli-utils/graph-converter.d.ts.map +1 -0
- package/dist/cli-utils/graph-converter.unit.test.d.ts +5 -0
- package/dist/cli-utils/graph-converter.unit.test.d.ts.map +1 -0
- package/dist/cli-utils/graph-loader.d.ts +30 -0
- package/dist/cli-utils/graph-loader.d.ts.map +1 -0
- package/dist/cli-utils/spec-utils.d.ts +30 -0
- package/dist/cli-utils/spec-utils.d.ts.map +1 -0
- package/dist/cli.js +11416 -15
- package/dist/domain/claims.d.ts +56 -0
- package/dist/domain/claims.d.ts.map +1 -0
- package/dist/domain/index.d.ts +8 -0
- package/dist/domain/index.d.ts.map +1 -0
- package/dist/domain/tables.d.ts +66 -0
- package/dist/domain/tables.d.ts.map +1 -0
- package/dist/experiments/baselines/betweenness-ranking.d.ts +38 -0
- package/dist/experiments/baselines/betweenness-ranking.d.ts.map +1 -0
- package/dist/experiments/baselines/cross-seed-affinity.d.ts +141 -0
- package/dist/experiments/baselines/cross-seed-affinity.d.ts.map +1 -0
- package/dist/experiments/baselines/degree-sum-ranking.d.ts +38 -0
- package/dist/experiments/baselines/degree-sum-ranking.d.ts.map +1 -0
- package/dist/experiments/baselines/degree-surprise.d.ts +134 -0
- package/dist/experiments/baselines/degree-surprise.d.ts.map +1 -0
- package/dist/experiments/baselines/delayed-termination.d.ts +138 -0
- package/dist/experiments/baselines/delayed-termination.d.ts.map +1 -0
- package/dist/experiments/baselines/ensemble-expansion.d.ts +123 -0
- package/dist/experiments/baselines/ensemble-expansion.d.ts.map +1 -0
- package/dist/experiments/baselines/frontier-balanced.d.ts +3 -0
- package/dist/experiments/baselines/frontier-balanced.d.ts.map +1 -1
- package/dist/experiments/baselines/frontier-balanced.unit.test.d.ts +2 -0
- package/dist/experiments/baselines/frontier-balanced.unit.test.d.ts.map +1 -0
- package/dist/experiments/baselines/index.d.ts +16 -0
- package/dist/experiments/baselines/index.d.ts.map +1 -1
- package/dist/experiments/baselines/jaccard-arithmetic-ranking.d.ts +38 -0
- package/dist/experiments/baselines/jaccard-arithmetic-ranking.d.ts.map +1 -0
- package/dist/experiments/baselines/pagerank-sum-ranking.d.ts +46 -0
- package/dist/experiments/baselines/pagerank-sum-ranking.d.ts.map +1 -0
- package/dist/experiments/baselines/random-path-ranking.d.ts +42 -0
- package/dist/experiments/baselines/random-path-ranking.d.ts.map +1 -0
- package/dist/experiments/baselines/random-priority.d.ts +3 -0
- package/dist/experiments/baselines/random-priority.d.ts.map +1 -1
- package/dist/experiments/baselines/random-priority.unit.test.d.ts +2 -0
- package/dist/experiments/baselines/random-priority.unit.test.d.ts.map +1 -0
- package/dist/experiments/baselines/retroactive-path-enum.d.ts +91 -0
- package/dist/experiments/baselines/retroactive-path-enum.d.ts.map +1 -0
- package/dist/experiments/baselines/shortest-path-ranking.d.ts +40 -0
- package/dist/experiments/baselines/shortest-path-ranking.d.ts.map +1 -0
- package/dist/experiments/baselines/standard-bfs.d.ts +7 -0
- package/dist/experiments/baselines/standard-bfs.d.ts.map +1 -1
- package/dist/experiments/baselines/standard-bfs.unit.test.d.ts +2 -0
- package/dist/experiments/baselines/standard-bfs.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/harness/evaluation.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/harness/evaluation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/harness/evaluator.d.ts +55 -0
- package/dist/experiments/evaluation/__tests__/harness/evaluator.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/harness/fixtures.d.ts +45 -0
- package/dist/experiments/evaluation/__tests__/harness/fixtures.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/harness/index.d.ts +16 -0
- package/dist/experiments/evaluation/__tests__/harness/index.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/harness/types.d.ts +138 -0
- package/dist/experiments/evaluation/__tests__/harness/types.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/originality-correctness-significance.integration.test.d.ts +31 -0
- package/dist/experiments/evaluation/__tests__/originality-correctness-significance.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/thesis-validation.exp.integration.test.d.ts +15 -0
- package/dist/experiments/evaluation/__tests__/thesis-validation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/adapter-roundtrip.unit.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/adapter-roundtrip.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/canary-tests.integration.test.d.ts +17 -0
- package/dist/experiments/evaluation/__tests__/validation/canary-tests.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/baselines/high-degree-first.d.ts +26 -0
- package/dist/experiments/evaluation/__tests__/validation/common/baselines/high-degree-first.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/baselines/low-degree-first.d.ts +26 -0
- package/dist/experiments/evaluation/__tests__/validation/common/baselines/low-degree-first.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/benchmark-graph-expander.d.ts +58 -0
- package/dist/experiments/evaluation/__tests__/validation/common/benchmark-graph-expander.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/benchmark-graph-expander.unit.test.d.ts +16 -0
- package/dist/experiments/evaluation/__tests__/validation/common/benchmark-graph-expander.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/graph-generators.d.ts +51 -0
- package/dist/experiments/evaluation/__tests__/validation/common/graph-generators.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/instrumented-expander.d.ts +31 -0
- package/dist/experiments/evaluation/__tests__/validation/common/instrumented-expander.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/instrumented-expander.unit.test.d.ts +16 -0
- package/dist/experiments/evaluation/__tests__/validation/common/instrumented-expander.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/path-ranking-helpers.d.ts +95 -0
- package/dist/experiments/evaluation/__tests__/validation/common/path-ranking-helpers.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/representativeness-helpers.d.ts +56 -0
- package/dist/experiments/evaluation/__tests__/validation/common/representativeness-helpers.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/statistical-functions.d.ts +78 -0
- package/dist/experiments/evaluation/__tests__/validation/common/statistical-functions.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/test-graph-expander.d.ts +32 -0
- package/dist/experiments/evaluation/__tests__/validation/common/test-graph-expander.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/common/test-graph-expander.unit.test.d.ts +15 -0
- package/dist/experiments/evaluation/__tests__/validation/common/test-graph-expander.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/comparative-summary.exp.integration.test.d.ts +10 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/comparative-summary.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/execution-time.exp.integration.test.d.ts +7 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/execution-time.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/literature-review-metrics.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/literature-review-metrics.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/method-ranking.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/method-ranking.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/multi-method-comparison.exp.integration.test.d.ts +9 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/multi-method-comparison.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/novel-algorithm-comparison.exp.integration.test.d.ts +12 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/novel-algorithm-comparison.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/perturbation-consistency.exp.integration.test.d.ts +9 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/perturbation-consistency.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/validation-summary.exp.integration.test.d.ts +9 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/validation-summary.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/variability-injection.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/comparative/variability-injection.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/graph-adapters.property.unit.test.d.ts +15 -0
- package/dist/experiments/evaluation/__tests__/validation/graph-adapters.property.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/classification/classification-evaluation.exp.integration.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/classification/classification-evaluation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/cora.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/cora.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/facebook.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/facebook.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/karate-club.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/karate-club.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/les-mis.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/les-mis.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/comparative/method-comparison.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/comparative/method-comparison.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/correctness/modularity-quality.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/correctness/modularity-quality.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/cora.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/cora.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/facebook.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/facebook.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/karate-club.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/karate-club.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/les-mis.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/les-mis.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/comparative/core-periphery-analysis.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/comparative/core-periphery-analysis.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/correctness/nested-hierarchy.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/correctness/nested-hierarchy.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/generation/generation-evaluation.exp.integration.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/generation/generation-evaluation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/citeseer.exp.integration.test.d.ts +16 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/citeseer.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/cora.exp.integration.test.d.ts +16 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/cora.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/facebook.exp.integration.test.d.ts +16 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/facebook.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/iteration-scaling.exp.integration.test.d.ts +20 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/iteration-scaling.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/karate-club.exp.integration.test.d.ts +17 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/karate-club.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/les-mis.exp.integration.test.d.ts +16 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/les-mis.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/comparative/multi-method-comparison.exp.integration.test.d.ts +16 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/comparative/multi-method-comparison.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/comparative/ranking-correlation.exp.integration.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/comparative/ranking-correlation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/comparative/statistical-significance.exp.integration.test.d.ts +16 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/comparative/statistical-significance.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/correctness/formula-correctness.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/correctness/formula-correctness.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/correctness/geometric-mean-property.exp.integration.test.d.ts +11 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/correctness/geometric-mean-property.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/correctness/length-penalty.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/correctness/length-penalty.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/correctness/n-path-generalization.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/correctness/n-path-generalization.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/originality/mi-sensitivity.exp.integration.test.d.ts +15 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/originality/mi-sensitivity.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/originality/path-diversity-benefit.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/originality/path-diversity-benefit.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/originality/ranking-difference.exp.integration.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/originality/ranking-difference.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/representativeness/__tests__/structural-coverage.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/representativeness/__tests__/structural-coverage.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/representativeness/__tests__/topological-representativeness.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/representativeness/__tests__/topological-representativeness.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/scenarios/multi-path-comparison.exp.integration.test.d.ts +12 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/scenarios/multi-path-comparison.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/scenarios/scale-free-ranking.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/scenarios/scale-free-ranking.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/scenarios/weak-link-paths.exp.integration.test.d.ts +15 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/scenarios/weak-link-paths.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/significance/hub-avoidance.exp.integration.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/significance/hub-avoidance.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/significance/quality-improvement.exp.integration.test.d.ts +15 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/significance/quality-improvement.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/significance/ranking-stability.exp.integration.test.d.ts +15 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/significance/ranking-stability.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/ranking-baseline-comparison.exp.integration.test.d.ts +21 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/ranking/ranking-baseline-comparison.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/benchmarks/citeseer.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/benchmarks/citeseer.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/benchmarks/cora.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/benchmarks/cora.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/benchmarks/facebook.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/benchmarks/facebook.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/benchmarks/karate-club.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/benchmarks/karate-club.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/benchmarks/les-mis.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/benchmarks/les-mis.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/correctness/n-seed-comparison.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/correctness/n-seed-comparison.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/correctness/validity-formula.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/correctness/validity-formula.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/correctness/validity-n-seed.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/correctness/validity-n-seed.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/correctness/validity-termination.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/correctness/validity-termination.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/double-star.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/double-star.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/expansion-order.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/expansion-order.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/metrics.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/metrics.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/multi-hub.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/multi-hub.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/scale-free.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/scale-free.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/star-graph.exp.integration.test.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/node-explosion/star-graph.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/originality/novelty-structural-difference.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/originality/novelty-structural-difference.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/aggregation.exp.integration.test.d.ts +5 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/aggregation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/between-graph-ground-truth.exp.integration.test.d.ts +5 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/between-graph-ground-truth.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/degree-distribution.exp.integration.test.d.ts +5 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/degree-distribution.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/ego-network-n1.exp.integration.test.d.ts +5 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/ego-network-n1.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/fixtures/index.d.ts +2 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/fixtures/index.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/fixtures/test-graph-expander.d.ts +56 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/fixtures/test-graph-expander.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/full-pipeline.exp.integration.test.d.ts +5 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/full-pipeline.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/path-diversity.exp.integration.test.d.ts +5 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/representativeness/path-diversity.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/significance/value-edge-efficiency.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/significance/value-edge-efficiency.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/significance/value-hub-mitigation.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/significance/value-hub-mitigation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/significance/value-representativeness.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/degree-prioritised/significance/value-representativeness.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/correctness/entropy-formula.exp.integration.test.d.ts +15 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/correctness/entropy-formula.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/correctness/priority-formula.exp.integration.test.d.ts +18 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/correctness/priority-formula.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/correctness/termination-guarantee.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/correctness/termination-guarantee.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/originality/cross-boundary-discovery.exp.integration.test.d.ts +12 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/originality/cross-boundary-discovery.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/originality/entropy-ordering-difference.exp.integration.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/originality/entropy-ordering-difference.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/significance/hub-mitigation.exp.integration.test.d.ts +13 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/significance/hub-mitigation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/significance/type-diversity.exp.integration.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/entropy-guided/significance/type-diversity.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/overlap-based/overlap-based-expansion.integration.test.d.ts +7 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/overlap-based/overlap-based-expansion.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/correctness/early-termination.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/correctness/early-termination.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/correctness/path-potential-computation.exp.integration.test.d.ts +11 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/correctness/path-potential-computation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/correctness/priority-formula.exp.integration.test.d.ts +10 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/correctness/priority-formula.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/originality/frontier-divergence.exp.integration.test.d.ts +12 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/originality/frontier-divergence.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/originality/path-diversity-improvement.exp.integration.test.d.ts +12 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/originality/path-diversity-improvement.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/significance/frontier-balance.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/significance/frontier-balance.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/significance/path-overlap-reduction.exp.integration.test.d.ts +8 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/path-preserving/significance/path-overlap-reduction.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/correctness/jaccard-mi-estimation.exp.integration.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/correctness/jaccard-mi-estimation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/correctness/phase1-formula.exp.integration.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/correctness/phase1-formula.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/correctness/phase2-formula.exp.integration.test.d.ts +14 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/correctness/phase2-formula.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/originality/adaptive-priority.exp.integration.test.d.ts +17 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/originality/adaptive-priority.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/originality/two-phase-transition.exp.integration.test.d.ts +18 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/originality/two-phase-transition.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/significance/no-precomputation.exp.integration.test.d.ts +15 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/significance/no-precomputation.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/significance/salience-coverage.exp.integration.test.d.ts +15 -0
- package/dist/experiments/evaluation/__tests__/validation/primary/traversal/retrospective-salience/significance/salience-coverage.exp.integration.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/baselines/degree-ranker.unit.test.d.ts +2 -0
- package/dist/experiments/evaluation/baselines/degree-ranker.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/baselines/pagerank-ranker.unit.test.d.ts +2 -0
- package/dist/experiments/evaluation/baselines/pagerank-ranker.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/baselines/random-ranker.unit.test.d.ts +2 -0
- package/dist/experiments/evaluation/baselines/random-ranker.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/baselines/shortest-path-ranker.unit.test.d.ts +2 -0
- package/dist/experiments/evaluation/baselines/shortest-path-ranker.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/baselines/weight-ranker.unit.test.d.ts +2 -0
- package/dist/experiments/evaluation/baselines/weight-ranker.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/claims/index.d.ts +7 -0
- package/dist/experiments/evaluation/claims/index.d.ts.map +1 -0
- package/dist/experiments/evaluation/claims/thesis-claims.d.ts +111 -0
- package/dist/experiments/evaluation/claims/thesis-claims.d.ts.map +1 -0
- package/dist/experiments/evaluation/classification/classification-evaluator.d.ts +44 -0
- package/dist/experiments/evaluation/classification/classification-evaluator.d.ts.map +1 -0
- package/dist/experiments/evaluation/classification/feature-extractor.d.ts +50 -0
- package/dist/experiments/evaluation/classification/feature-extractor.d.ts.map +1 -0
- package/dist/experiments/evaluation/classification/graph-classifier.d.ts +103 -0
- package/dist/experiments/evaluation/classification/graph-classifier.d.ts.map +1 -0
- package/dist/experiments/evaluation/classification/index.d.ts +11 -0
- package/dist/experiments/evaluation/classification/index.d.ts.map +1 -0
- package/dist/experiments/evaluation/fixtures/algorithm-validation.unit.test.d.ts +12 -0
- package/dist/experiments/evaluation/fixtures/algorithm-validation.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/fixtures/benchmark-datasets.d.ts +44 -3
- package/dist/experiments/evaluation/fixtures/benchmark-datasets.d.ts.map +1 -1
- package/dist/experiments/evaluation/fixtures/benchmark-datasets.unit.test.d.ts +0 -4
- package/dist/experiments/evaluation/fixtures/benchmark-datasets.unit.test.d.ts.map +1 -1
- package/dist/experiments/evaluation/generation/constrained-generator.d.ts +61 -0
- package/dist/experiments/evaluation/generation/constrained-generator.d.ts.map +1 -0
- package/dist/experiments/evaluation/generation/generation-evaluator.d.ts +56 -0
- package/dist/experiments/evaluation/generation/generation-evaluator.d.ts.map +1 -0
- package/dist/experiments/evaluation/generation/index.d.ts +10 -0
- package/dist/experiments/evaluation/generation/index.d.ts.map +1 -0
- package/dist/experiments/evaluation/ground-truth/importance-based.d.ts.map +1 -1
- package/dist/experiments/evaluation/ground-truth/importance-based.unit.test.d.ts +5 -0
- package/dist/experiments/evaluation/ground-truth/importance-based.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/loaders/decompress.d.ts +141 -33
- package/dist/experiments/evaluation/loaders/decompress.d.ts.map +1 -1
- package/dist/experiments/evaluation/loaders/edge-list-loader.d.ts +44 -0
- package/dist/experiments/evaluation/loaders/edge-list-loader.d.ts.map +1 -1
- package/dist/experiments/evaluation/loaders/index.d.ts +2 -2
- package/dist/experiments/evaluation/loaders/index.d.ts.map +1 -1
- package/dist/experiments/evaluation/metrics/index.d.ts +1 -0
- package/dist/experiments/evaluation/metrics/index.d.ts.map +1 -1
- package/dist/experiments/evaluation/metrics/metric-calculators.property.unit.test.d.ts +16 -0
- package/dist/experiments/evaluation/metrics/metric-calculators.property.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/metrics/metrics-boundary-conditions.unit.test.d.ts +2 -0
- package/dist/experiments/evaluation/metrics/metrics-boundary-conditions.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/metrics/salience-coverage.d.ts +147 -0
- package/dist/experiments/evaluation/metrics/salience-coverage.d.ts.map +1 -0
- package/dist/experiments/evaluation/path-planting/citation-planting.unit.test.d.ts +5 -0
- package/dist/experiments/evaluation/path-planting/citation-planting.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/path-planting/heterogeneous-planting.unit.test.d.ts +5 -0
- package/dist/experiments/evaluation/path-planting/heterogeneous-planting.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/path-planting/noise-generator.unit.test.d.ts +5 -0
- package/dist/experiments/evaluation/path-planting/noise-generator.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/path-planting/path-generator.unit.test.d.ts +5 -0
- package/dist/experiments/evaluation/path-planting/path-generator.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/runner/experiment-config.unit.test.d.ts +10 -0
- package/dist/experiments/evaluation/runner/experiment-config.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/runner/experiment-runner.unit.test.d.ts +5 -0
- package/dist/experiments/evaluation/runner/experiment-runner.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/runner/report-generator.unit.test.d.ts +5 -0
- package/dist/experiments/evaluation/runner/report-generator.unit.test.d.ts.map +1 -0
- package/dist/experiments/evaluation/statistics/paired-tests.d.ts.map +1 -1
- package/dist/experiments/experiments/bidirectional-bfs.d.ts +42 -0
- package/dist/experiments/experiments/bidirectional-bfs.d.ts.map +1 -0
- package/dist/experiments/experiments/index.d.ts +10 -0
- package/dist/experiments/experiments/index.d.ts.map +1 -0
- package/dist/experiments/experiments/path-ranking.d.ts +29 -0
- package/dist/experiments/experiments/path-ranking.d.ts.map +1 -0
- package/dist/experiments/experiments/salience-coverage-comparison.d.ts +19 -0
- package/dist/experiments/experiments/salience-coverage-comparison.d.ts.map +1 -0
- package/dist/experiments/experiments/seeded-expansion.d.ts +43 -0
- package/dist/experiments/experiments/seeded-expansion.d.ts.map +1 -0
- package/dist/experiments/fixtures/mock-graph-expander.d.ts +2 -1
- package/dist/experiments/fixtures/mock-graph-expander.d.ts.map +1 -1
- package/dist/experiments/metrics/collector.d.ts +49 -0
- package/dist/experiments/metrics/collector.d.ts.map +1 -0
- package/dist/experiments/metrics/hub-avoidance-calculator.d.ts +97 -0
- package/dist/experiments/metrics/hub-avoidance-calculator.d.ts.map +1 -0
- package/dist/experiments/metrics/index.d.ts +10 -0
- package/dist/experiments/metrics/index.d.ts.map +1 -0
- package/dist/experiments/metrics/storage.d.ts +29 -0
- package/dist/experiments/metrics/storage.d.ts.map +1 -0
- package/dist/experiments/metrics/types.d.ts +362 -0
- package/dist/experiments/metrics/types.d.ts.map +1 -0
- package/dist/experiments/proofs/path-salience/boundedness.unit.test.d.ts +10 -0
- package/dist/experiments/proofs/path-salience/boundedness.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/path-salience/dpi-consistency.unit.test.d.ts +11 -0
- package/dist/experiments/proofs/path-salience/dpi-consistency.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/path-salience/equal-length.unit.test.d.ts +11 -0
- package/dist/experiments/proofs/path-salience/equal-length.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/path-salience/length-independence.unit.test.d.ts +11 -0
- package/dist/experiments/proofs/path-salience/length-independence.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/path-salience/monotonicity.unit.test.d.ts +10 -0
- package/dist/experiments/proofs/path-salience/monotonicity.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/path-salience/subpath-optimality.unit.test.d.ts +12 -0
- package/dist/experiments/proofs/path-salience/subpath-optimality.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/path-salience/universality.unit.test.d.ts +15 -0
- package/dist/experiments/proofs/path-salience/universality.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/path-salience/weak-link.unit.test.d.ts +10 -0
- package/dist/experiments/proofs/path-salience/weak-link.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/seed-bounded/completeness.unit.test.d.ts +10 -0
- package/dist/experiments/proofs/seed-bounded/completeness.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/seed-bounded/degeneracy.unit.test.d.ts +16 -0
- package/dist/experiments/proofs/seed-bounded/degeneracy.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/seed-bounded/order-independence.unit.test.d.ts +10 -0
- package/dist/experiments/proofs/seed-bounded/order-independence.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/seed-bounded/termination.unit.test.d.ts +11 -0
- package/dist/experiments/proofs/seed-bounded/termination.unit.test.d.ts.map +1 -0
- package/dist/experiments/proofs/test-utils.d.ts +161 -0
- package/dist/experiments/proofs/test-utils.d.ts.map +1 -0
- package/dist/experiments/run-experiments.d.ts +19 -0
- package/dist/experiments/run-experiments.d.ts.map +1 -0
- package/dist/experiments/suts/degree-sum-ranking-sut.d.ts +52 -0
- package/dist/experiments/suts/degree-sum-ranking-sut.d.ts.map +1 -0
- package/dist/experiments/suts/index.d.ts +13 -0
- package/dist/experiments/suts/index.d.ts.map +1 -0
- package/dist/experiments/suts/jaccard-arithmetic-ranking-sut.d.ts +52 -0
- package/dist/experiments/suts/jaccard-arithmetic-ranking-sut.d.ts.map +1 -0
- package/dist/experiments/suts/pagerank-sum-ranking-sut.d.ts +52 -0
- package/dist/experiments/suts/pagerank-sum-ranking-sut.d.ts.map +1 -0
- package/dist/experiments/suts/path-salience-sut.d.ts +62 -0
- package/dist/experiments/suts/path-salience-sut.d.ts.map +1 -0
- package/dist/experiments/suts/random-ranking-sut.d.ts +52 -0
- package/dist/experiments/suts/random-ranking-sut.d.ts.map +1 -0
- package/dist/experiments/suts/shortest-ranking-sut.d.ts +51 -0
- package/dist/experiments/suts/shortest-ranking-sut.d.ts.map +1 -0
- package/dist/formats/gml/fetch.unit.test.d.ts +2 -0
- package/dist/formats/gml/fetch.unit.test.d.ts.map +1 -0
- package/dist/formats/gml/serialize.unit.test.d.ts +5 -0
- package/dist/formats/gml/serialize.unit.test.d.ts.map +1 -0
- package/dist/formats/pajek/fetch.unit.test.d.ts +2 -0
- package/dist/formats/pajek/fetch.unit.test.d.ts.map +1 -0
- package/dist/formats/pajek/parse.unit.test.d.ts +5 -0
- package/dist/formats/pajek/parse.unit.test.d.ts.map +1 -0
- package/dist/formats/snap/fetch.unit.test.d.ts +2 -0
- package/dist/formats/snap/fetch.unit.test.d.ts.map +1 -0
- package/dist/formats/ucinet/fetch.unit.test.d.ts +2 -0
- package/dist/formats/ucinet/fetch.unit.test.d.ts.map +1 -0
- package/dist/formats/ucinet/parse.unit.test.d.ts +5 -0
- package/dist/formats/ucinet/parse.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/bipartite.unit.test.d.ts +2 -0
- package/dist/generation/generators/bipartite.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/connectivity.unit.test.d.ts +2 -0
- package/dist/generation/generators/connectivity.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/core-structures.unit.test.d.ts +2 -0
- package/dist/generation/generators/core-structures.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/density-helpers.d.ts.map +1 -1
- package/dist/generation/generators/density-helpers.unit.test.d.ts +2 -0
- package/dist/generation/generators/density-helpers.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/edge-generator.d.ts.map +1 -1
- package/dist/generation/generators/edge-generator.unit.test.d.ts +2 -0
- package/dist/generation/generators/edge-generator.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/forbidden-subgraph.d.ts +83 -0
- package/dist/generation/generators/forbidden-subgraph.d.ts.map +1 -0
- package/dist/generation/generators/geometric.d.ts +10 -0
- package/dist/generation/generators/geometric.d.ts.map +1 -1
- package/dist/generation/generators/geometric.unit.test.d.ts +2 -0
- package/dist/generation/generators/geometric.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/intersection.d.ts +21 -0
- package/dist/generation/generators/intersection.d.ts.map +1 -0
- package/dist/generation/generators/invariants.d.ts.map +1 -1
- package/dist/generation/generators/invariants.unit.test.d.ts +2 -0
- package/dist/generation/generators/invariants.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/network-structures.unit.test.d.ts +2 -0
- package/dist/generation/generators/network-structures.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/node-generator.unit.test.d.ts +2 -0
- package/dist/generation/generators/node-generator.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/path-cycle.unit.test.d.ts +2 -0
- package/dist/generation/generators/path-cycle.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/perfect-variants.d.ts +49 -0
- package/dist/generation/generators/perfect-variants.d.ts.map +1 -0
- package/dist/generation/generators/probe.d.ts +19 -0
- package/dist/generation/generators/probe.d.ts.map +1 -0
- package/dist/generation/generators/property-computers.unit.test.d.ts +2 -0
- package/dist/generation/generators/property-computers.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/structural-classes.unit.test.d.ts +2 -0
- package/dist/generation/generators/structural-classes.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/structural.d.ts +11 -0
- package/dist/generation/generators/structural.d.ts.map +1 -0
- package/dist/generation/generators/structure-handlers.unit.test.d.ts +2 -0
- package/dist/generation/generators/structure-handlers.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/symmetry.unit.test.d.ts +2 -0
- package/dist/generation/generators/symmetry.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/validation-helpers.unit.test.d.ts +2 -0
- package/dist/generation/generators/validation-helpers.unit.test.d.ts.map +1 -0
- package/dist/generation/generators/width.d.ts +37 -0
- package/dist/generation/generators/width.d.ts.map +1 -0
- package/dist/generation/graph-validator.d.ts.map +1 -1
- package/dist/generation/spec/advanced.unit.test.d.ts +5 -0
- package/dist/generation/spec/advanced.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/core.d.ts +4 -0
- package/dist/generation/spec/core.d.ts.map +1 -1
- package/dist/generation/spec/core.unit.test.d.ts +5 -0
- package/dist/generation/spec/core.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/forbidden-subgraph.d.ts +89 -0
- package/dist/generation/spec/forbidden-subgraph.d.ts.map +1 -0
- package/dist/generation/spec/geometric.d.ts +28 -9
- package/dist/generation/spec/geometric.d.ts.map +1 -1
- package/dist/generation/spec/geometric.unit.test.d.ts +5 -0
- package/dist/generation/spec/geometric.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/index.d.ts +1 -1
- package/dist/generation/spec/index.d.ts.map +1 -1
- package/dist/generation/spec/intersection.d.ts +49 -0
- package/dist/generation/spec/intersection.d.ts.map +1 -0
- package/dist/generation/spec/invariants.unit.test.d.ts +5 -0
- package/dist/generation/spec/invariants.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/metrics.unit.test.d.ts +5 -0
- package/dist/generation/spec/metrics.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/network.unit.test.d.ts +5 -0
- package/dist/generation/spec/network.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/new-classes-index.d.ts +15 -0
- package/dist/generation/spec/new-classes-index.d.ts.map +1 -0
- package/dist/generation/spec/path-cycle.unit.test.d.ts +5 -0
- package/dist/generation/spec/path-cycle.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/perfect-variants.d.ts +39 -0
- package/dist/generation/spec/perfect-variants.d.ts.map +1 -0
- package/dist/generation/spec/probe.d.ts +29 -0
- package/dist/generation/spec/probe.d.ts.map +1 -0
- package/dist/generation/spec/products.unit.test.d.ts +5 -0
- package/dist/generation/spec/products.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/regularity.unit.test.d.ts +5 -0
- package/dist/generation/spec/regularity.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/structural.d.ts +12 -1
- package/dist/generation/spec/structural.d.ts.map +1 -1
- package/dist/generation/spec/structural.unit.test.d.ts +5 -0
- package/dist/generation/spec/structural.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/symmetry.unit.test.d.ts +5 -0
- package/dist/generation/spec/symmetry.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/test.unit.test.d.ts +5 -0
- package/dist/generation/spec/test.unit.test.d.ts.map +1 -0
- package/dist/generation/spec/width.d.ts +29 -0
- package/dist/generation/spec/width.d.ts.map +1 -0
- package/dist/generation/spec.d.ts +23 -4
- package/dist/generation/spec.d.ts.map +1 -1
- package/dist/index.cjs +31 -31
- package/dist/index.d.ts +3 -1
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +6941 -4768
- package/dist/index.umd.js +33 -33
- package/dist/interfaces/graph-expander.d.ts +44 -2
- package/dist/interfaces/graph-expander.d.ts.map +1 -1
- package/dist/interfaces/graph-expander.unit.test.d.ts +2 -0
- package/dist/interfaces/graph-expander.unit.test.d.ts.map +1 -0
- package/dist/interfaces/readable-graph.unit.test.d.ts +2 -0
- package/dist/interfaces/readable-graph.unit.test.d.ts.map +1 -0
- package/dist/registries/index.d.ts +16 -0
- package/dist/registries/index.d.ts.map +1 -0
- package/dist/registries/register-cases.d.ts +91 -0
- package/dist/registries/register-cases.d.ts.map +1 -0
- package/dist/registries/register-overlap-suts.d.ts +28 -0
- package/dist/registries/register-overlap-suts.d.ts.map +1 -0
- package/dist/registries/register-ranking-cases.d.ts +36 -0
- package/dist/registries/register-ranking-cases.d.ts.map +1 -0
- package/dist/registries/register-ranking-suts.d.ts +83 -0
- package/dist/registries/register-ranking-suts.d.ts.map +1 -0
- package/dist/registries/register-suts.d.ts +55 -0
- package/dist/registries/register-suts.d.ts.map +1 -0
- package/dist/suts/degree-prioritised-v1.0.0.d.ts +56 -0
- package/dist/suts/degree-prioritised-v1.0.0.d.ts.map +1 -0
- package/dist/suts/entropy-guided-v1.0.0.d.ts +55 -0
- package/dist/suts/entropy-guided-v1.0.0.d.ts.map +1 -0
- package/dist/suts/heterogeneity-aware-v1.0.0.d.ts +57 -0
- package/dist/suts/heterogeneity-aware-v1.0.0.d.ts.map +1 -0
- package/dist/suts/multi-frontier-adaptive-v1.0.0.d.ts +56 -0
- package/dist/suts/multi-frontier-adaptive-v1.0.0.d.ts.map +1 -0
- package/dist/suts/path-preserving-v1.0.0.d.ts +58 -0
- package/dist/suts/path-preserving-v1.0.0.d.ts.map +1 -0
- package/dist/suts/path-salience-v1.0.0.d.ts +57 -0
- package/dist/suts/path-salience-v1.0.0.d.ts.map +1 -0
- package/dist/suts/random-ranking-v1.0.0.d.ts +50 -0
- package/dist/suts/random-ranking-v1.0.0.d.ts.map +1 -0
- package/dist/suts/retrospective-salience-v1.0.0.d.ts +57 -0
- package/dist/suts/retrospective-salience-v1.0.0.d.ts.map +1 -0
- package/dist/suts/shortest-ranking-v1.0.0.d.ts +49 -0
- package/dist/suts/shortest-ranking-v1.0.0.d.ts.map +1 -0
- package/dist/suts/standard-bfs-v1.0.0.d.ts +53 -0
- package/dist/suts/standard-bfs-v1.0.0.d.ts.map +1 -0
- package/dist/types/graph-core.d.ts +176 -0
- package/dist/types/graph-core.d.ts.map +1 -0
- package/dist/types/graph-core.unit.test.d.ts +5 -0
- package/dist/types/graph-core.unit.test.d.ts.map +1 -0
- package/dist/utils/graph-adapters.d.ts +101 -0
- package/dist/utils/graph-adapters.d.ts.map +1 -0
- package/dist/utils/graph-adapters.unit.test.d.ts +5 -0
- package/dist/utils/graph-adapters.unit.test.d.ts.map +1 -0
- package/dist/utils/wayback.unit.test.d.ts +2 -0
- package/dist/utils/wayback.unit.test.d.ts.map +1 -0
- package/dist/validation/basic-validators.unit.test.d.ts +2 -0
- package/dist/validation/basic-validators.unit.test.d.ts.map +1 -0
- package/dist/validation/coloring-validator.unit.test.d.ts +2 -0
- package/dist/validation/coloring-validator.unit.test.d.ts.map +1 -0
- package/dist/validation/connectivity-validators.unit.test.d.ts +2 -0
- package/dist/validation/connectivity-validators.unit.test.d.ts.map +1 -0
- package/dist/validation/degree-validators.unit.test.d.ts +2 -0
- package/dist/validation/degree-validators.unit.test.d.ts.map +1 -0
- package/dist/validation/density-connectivity.unit.test.d.ts +2 -0
- package/dist/validation/density-connectivity.unit.test.d.ts.map +1 -0
- package/dist/validation/extremal.unit.test.d.ts +2 -0
- package/dist/validation/extremal.unit.test.d.ts.map +1 -0
- package/dist/validation/flow-validator.unit.test.d.ts +2 -0
- package/dist/validation/flow-validator.unit.test.d.ts.map +1 -0
- package/dist/validation/forbidden-subgraph-helpers.d.ts +45 -0
- package/dist/validation/forbidden-subgraph-helpers.d.ts.map +1 -0
- package/dist/validation/forbidden-subgraph.d.ts +66 -0
- package/dist/validation/forbidden-subgraph.d.ts.map +1 -0
- package/dist/validation/geometric.unit.test.d.ts +2 -0
- package/dist/validation/geometric.unit.test.d.ts.map +1 -0
- package/dist/validation/helper-functions.d.ts +1 -0
- package/dist/validation/helper-functions.d.ts.map +1 -1
- package/dist/validation/helper-functions.unit.test.d.ts +2 -0
- package/dist/validation/helper-functions.unit.test.d.ts.map +1 -0
- package/dist/validation/index.d.ts +4 -0
- package/dist/validation/index.d.ts.map +1 -1
- package/dist/validation/intersection.d.ts +17 -0
- package/dist/validation/intersection.d.ts.map +1 -0
- package/dist/validation/invariant.unit.test.d.ts +2 -0
- package/dist/validation/invariant.unit.test.d.ts.map +1 -0
- package/dist/validation/minor.unit.test.d.ts +2 -0
- package/dist/validation/minor.unit.test.d.ts.map +1 -0
- package/dist/validation/network.d.ts.map +1 -1
- package/dist/validation/network.unit.test.d.ts +2 -0
- package/dist/validation/network.unit.test.d.ts.map +1 -0
- package/dist/validation/path-cycle.unit.test.d.ts +2 -0
- package/dist/validation/path-cycle.unit.test.d.ts.map +1 -0
- package/dist/validation/perfect-variants.d.ts +30 -0
- package/dist/validation/perfect-variants.d.ts.map +1 -0
- package/dist/validation/perfect-variants.unit.test.d.ts +5 -0
- package/dist/validation/perfect-variants.unit.test.d.ts.map +1 -0
- package/dist/validation/probe.d.ts +17 -0
- package/dist/validation/probe.d.ts.map +1 -0
- package/dist/validation/product.unit.test.d.ts +2 -0
- package/dist/validation/product.unit.test.d.ts.map +1 -0
- package/dist/validation/robustness.unit.test.d.ts +2 -0
- package/dist/validation/robustness.unit.test.d.ts.map +1 -0
- package/dist/validation/structural-class.d.ts.map +1 -1
- package/dist/validation/structural-class.unit.test.d.ts +2 -0
- package/dist/validation/structural-class.unit.test.d.ts.map +1 -0
- package/dist/validation/symmetry.d.ts.map +1 -1
- package/dist/validation/symmetry.unit.test.d.ts +2 -0
- package/dist/validation/symmetry.unit.test.d.ts.map +1 -0
- package/dist/validation/treewidth-validator.unit.test.d.ts +2 -0
- package/dist/validation/treewidth-validator.unit.test.d.ts.map +1 -0
- package/dist/validation/width.d.ts +27 -0
- package/dist/validation/width.d.ts.map +1 -0
- package/dist/validation/width.unit.test.d.ts +5 -0
- package/dist/validation/width.unit.test.d.ts.map +1 -0
- package/package.json +25 -2
|
@@ -0,0 +1,149 @@
|
|
|
1
|
+
import { GraphExpander } from '../../interfaces/graph-expander.js';
|
|
2
|
+
import { DegreePrioritisedExpansionResult } from './degree-prioritised-expansion.js';
|
|
3
|
+
/**
|
|
4
|
+
* Salience-Prioritised Multi-Seed Graph Expansion
|
|
5
|
+
*
|
|
6
|
+
* **Novel Contribution**: Path quality-aware node expansion that prioritizes
|
|
7
|
+
* nodes based on their participation in high-salience paths, rather than
|
|
8
|
+
* degree-based prioritization.
|
|
9
|
+
*
|
|
10
|
+
* **Key Innovation**: Unlike degree-prioritised expansion (which avoids hubs
|
|
11
|
+
* by expanding low-degree nodes first), salience-prioritised expansion actively
|
|
12
|
+
* seeks out nodes that appear in high-quality (high-MI) paths. This should
|
|
13
|
+
* result in higher salience coverage because the expansion naturally gravitates
|
|
14
|
+
* toward the same paths that Path Salience ranking identifies as important.
|
|
15
|
+
*
|
|
16
|
+
* **Design Relationship**:
|
|
17
|
+
* - DegreePrioritisedExpansion: Priority = node degree (ascending)
|
|
18
|
+
* - SaliencePrioritisedExpansion: Priority = node salience score (descending)
|
|
19
|
+
*
|
|
20
|
+
* **Priority Function**:
|
|
21
|
+
* - Primary: Node salience score (higher = better priority)
|
|
22
|
+
* - Secondary: Node degree (lower = better, for tie-breaking hub avoidance)
|
|
23
|
+
*
|
|
24
|
+
* **Expected Behavior**:
|
|
25
|
+
* - Higher salience coverage than degree-prioritised expansion
|
|
26
|
+
* - Discovered paths should more closely match Path Salience top-K
|
|
27
|
+
* - May sacrifice some hub-avoidance for path quality
|
|
28
|
+
*
|
|
29
|
+
* @template T - Node data type
|
|
30
|
+
*/
|
|
31
|
+
export declare class SaliencePrioritisedExpansion<T> implements GraphExpander<T> {
|
|
32
|
+
/** Salience scores for each node (pre-computed from Path Salience ranking) */
|
|
33
|
+
private readonly nodeSalience;
|
|
34
|
+
/** The underlying graph expander for neighbor access */
|
|
35
|
+
private readonly expander;
|
|
36
|
+
/** Seed nodes for expansion */
|
|
37
|
+
private readonly seeds;
|
|
38
|
+
/** Frontiers (one per seed) */
|
|
39
|
+
private readonly frontiers;
|
|
40
|
+
/** Statistics collected during expansion */
|
|
41
|
+
private stats;
|
|
42
|
+
/** Discovered paths between seed pairs */
|
|
43
|
+
private readonly paths;
|
|
44
|
+
/** Track which frontier owns each node */
|
|
45
|
+
private readonly nodeToFrontierIndex;
|
|
46
|
+
/** Track which seed pairs have connected */
|
|
47
|
+
private readonly connectedPairs;
|
|
48
|
+
/** Tracks when each node was first discovered (iteration number) */
|
|
49
|
+
private readonly nodeDiscoveryIteration;
|
|
50
|
+
/**
|
|
51
|
+
* Create a new salience-prioritised expansion.
|
|
52
|
+
*
|
|
53
|
+
* @param expander - Underlying graph expander for neighbor access
|
|
54
|
+
* @param seeds - Array of seed node IDs
|
|
55
|
+
* @param nodeSalience - Map of node ID to salience score (appearance count in top-K paths)
|
|
56
|
+
*/
|
|
57
|
+
constructor(expander: GraphExpander<T>, seeds: string[], nodeSalience: Map<string, number>);
|
|
58
|
+
/**
|
|
59
|
+
* Get neighbors of a node.
|
|
60
|
+
* @param nodeId
|
|
61
|
+
*/
|
|
62
|
+
getNeighbors(nodeId: string): Promise<{
|
|
63
|
+
targetId: string;
|
|
64
|
+
relationshipType: string;
|
|
65
|
+
}[]>;
|
|
66
|
+
/**
|
|
67
|
+
* Get node degree for priority computation.
|
|
68
|
+
* @param nodeId
|
|
69
|
+
*/
|
|
70
|
+
getDegree(nodeId: string): number;
|
|
71
|
+
/**
|
|
72
|
+
* Calculate weighted priority (delegates to underlying expander).
|
|
73
|
+
* @param nodeId
|
|
74
|
+
*/
|
|
75
|
+
calculatePriority(nodeId: string): number;
|
|
76
|
+
/**
|
|
77
|
+
* Get node data.
|
|
78
|
+
* @param nodeId
|
|
79
|
+
*/
|
|
80
|
+
getNode(nodeId: string): Promise<T | null>;
|
|
81
|
+
/**
|
|
82
|
+
* Add an edge to the output.
|
|
83
|
+
* @param source
|
|
84
|
+
* @param target
|
|
85
|
+
* @param relationshipType
|
|
86
|
+
*/
|
|
87
|
+
addEdge(source: string, target: string, relationshipType: string): void;
|
|
88
|
+
/**
|
|
89
|
+
* Run the expansion to completion.
|
|
90
|
+
*/
|
|
91
|
+
run(): Promise<DegreePrioritisedExpansionResult>;
|
|
92
|
+
/**
|
|
93
|
+
* Check if any frontier has unexpanded nodes.
|
|
94
|
+
*/
|
|
95
|
+
private hasNonEmptyFrontier;
|
|
96
|
+
/**
|
|
97
|
+
* Select the frontier with the highest-salience node.
|
|
98
|
+
*/
|
|
99
|
+
private selectHighestSalienceFrontier;
|
|
100
|
+
/**
|
|
101
|
+
* Reconstruct path between two seeds using parent pointers.
|
|
102
|
+
* @param fromFrontier
|
|
103
|
+
* @param fromFrontier.index
|
|
104
|
+
* @param fromFrontier.visited
|
|
105
|
+
* @param fromFrontier.parents
|
|
106
|
+
* @param toFrontier
|
|
107
|
+
* @param toFrontier.index
|
|
108
|
+
* @param toFrontier.visited
|
|
109
|
+
* @param toFrontier.parents
|
|
110
|
+
* @param meetingNode
|
|
111
|
+
*/
|
|
112
|
+
private reconstructPath;
|
|
113
|
+
/**
|
|
114
|
+
* Record degree in statistics.
|
|
115
|
+
* @param degree
|
|
116
|
+
*/
|
|
117
|
+
private recordDegree;
|
|
118
|
+
/**
|
|
119
|
+
* Get degree bucket for statistics.
|
|
120
|
+
* @param degree
|
|
121
|
+
*/
|
|
122
|
+
private getDegreeBucket;
|
|
123
|
+
}
|
|
124
|
+
/**
|
|
125
|
+
* Compute node salience scores from top-K salient paths.
|
|
126
|
+
*
|
|
127
|
+
* For each node, counts how many times it appears in the top-K salient paths.
|
|
128
|
+
* Nodes that appear more frequently in high-quality paths get higher scores.
|
|
129
|
+
*
|
|
130
|
+
* @param topKPaths - Array of top-K salient paths (as node ID arrays)
|
|
131
|
+
* @returns Map of node ID to salience score (appearance count)
|
|
132
|
+
*/
|
|
133
|
+
export declare const computeNodeSalienceScores: (topKPaths: string[][]) => Map<string, number>;
|
|
134
|
+
/**
|
|
135
|
+
* Compute node salience scores directly from Path Salience ranking results.
|
|
136
|
+
*
|
|
137
|
+
* Extracts node IDs from ranked path objects and computes appearance counts.
|
|
138
|
+
*
|
|
139
|
+
* @param rankedPaths - Array of ranked paths from Path Salience algorithm
|
|
140
|
+
* @returns Map of node ID to salience score
|
|
141
|
+
*/
|
|
142
|
+
export declare const computeNodeSalienceFromRankedPaths: (rankedPaths: Array<{
|
|
143
|
+
path: {
|
|
144
|
+
nodes: Array<{
|
|
145
|
+
id: string;
|
|
146
|
+
}>;
|
|
147
|
+
};
|
|
148
|
+
}>) => Map<string, number>;
|
|
149
|
+
//# sourceMappingURL=salience-prioritised-expansion.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"salience-prioritised-expansion.d.ts","sourceRoot":"","sources":["../../../src/algorithms/traversal/salience-prioritised-expansion.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,oCAAoC,CAAC;AACnE,OAAO,KAAK,EAAE,gCAAgC,EAAkB,MAAM,mCAAmC,CAAC;AAG1G;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,qBAAa,4BAA4B,CAAC,CAAC,CAAE,YAAW,aAAa,CAAC,CAAC,CAAC;IACvE,8EAA8E;IAC9E,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAsB;IAEnD,wDAAwD;IACxD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAmB;IAE5C,+BAA+B;IAC/B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;IAEjC,+BAA+B;IAC/B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAKlB;IAER,4CAA4C;IAC5C,OAAO,CAAC,KAAK,CAKX;IAEF,0CAA0C;IAC1C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoE;IAE1F,0CAA0C;IAC1C,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAA6B;IAEjE,4CAA4C;IAC5C,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAqB;IAEpD,oEAAoE;IACpE,OAAO,CAAC,QAAQ,CAAC,sBAAsB,CAA6B;IAEpE;;;;;;OAMG;gBACS,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAgC1F;;;OAGG;IACG,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAI7F;;;OAGG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAIjC;;;OAGG;IACH,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAIzC;;;OAGG;IACG,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC;IAIhD;;;;;OAKG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,GAAG,IAAI;IAIvE;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,gCAAgC,CAAC;IAwFtD;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAI3B;;OAEG;IACH,OAAO,CAAC,6BAA6B;IAkBrC;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,eAAe;IAgCvB;;;OAGG;IACH,OAAO,CAAC,YAAY;IAMpB;;;OAGG;IACH,OAAO,CAAC,eAAe;CASvB;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,yBAAyB,GAAI,WAAW,MAAM,EAAE,EAAE,KAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAWnF,CAAC;AAEF;;;;;;;GAOG;AACH,eAAO,MAAM,kCAAkC,GAAI,aAAa,KAAK,CAAC;IAAE,IAAI,EAAE;QAAE,KAAK,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAA;SAAE,CAAC,CAAA;KAAE,CAAA;CAAE,CAAC,KAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAGrI,CAAC"}
|
|
@@ -431,7 +431,7 @@ export type HierarchicalError = {
|
|
|
431
431
|
* @template T - Node identifier type (typically string)
|
|
432
432
|
* @remarks
|
|
433
433
|
* This interface defines the data structure returned by the Louvain algorithm.
|
|
434
|
-
* The actual function returns `Result<LouvainResult<string>, ClusteringError
|
|
434
|
+
* The actual function returns `Result<LouvainResult<string>, ClusteringError>` (see clustering/louvain.ts).
|
|
435
435
|
*
|
|
436
436
|
* **Performance Characteristics** (1000-node graph):
|
|
437
437
|
* - Phase 1 (Parameter Tuning): ~10-12 seconds
|
|
@@ -443,7 +443,7 @@ export type HierarchicalError = {
|
|
|
443
443
|
* - Auto mode (large graphs): Modularity ~0.19 (5% loss for 3-6x speedup)
|
|
444
444
|
* - Random mode: Modularity ~0.18-0.19 (acceptable for speed-critical use cases)
|
|
445
445
|
*/
|
|
446
|
-
export interface
|
|
446
|
+
export interface LouvainDesignResult<T = string> {
|
|
447
447
|
/** Map of community ID → community structure */
|
|
448
448
|
communities: Map<number, Community<T>>;
|
|
449
449
|
/** Modularity score (range: [-0.5, 1.0], higher is better) */
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"clustering-types.d.ts","sourceRoot":"","sources":["../../../src/algorithms/types/clustering-types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAMvC;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC;AAE/B;;GAEG;AACH,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAE9B;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC;;;GAGG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;;GAGG;AACH,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC;AAE7B;;;GAGG;AACH,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC;AAEnC;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,MAAM,CAAC;AAEvC;;;GAGG;AACH,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC;AAMtC;;;GAGG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC3B,uCAAuC;IACvC,EAAE,EAAE,WAAW,CAAC;IAEhB,+CAA+C;IAC/C,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,2CAA2C;IAC3C,aAAa,EAAE,MAAM,CAAC;IAEtB,kDAAkD;IAClD,aAAa,EAAE,MAAM,CAAC;IAEtB,8CAA8C;IAC9C,UAAU,EAAE,MAAM,CAAC;IAEnB,4DAA4D;IAC5D,OAAO,EAAE,MAAM,CAAC;IAEhB,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAC;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC3B,sCAAsC;IACtC,EAAE,EAAE,WAAW,CAAC;IAEhB,uCAAuC;IACvC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAC;IAEb,0DAA0D;IAC1D,QAAQ,EAAE,MAAM,CAAC;IAEjB,gDAAgD;IAChD,OAAO,EAAE,MAAM,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS;IACzB,2DAA2D;IAC3D,QAAQ,EAAE,MAAM,CAAC;IAEjB,4DAA4D;IAC5D,QAAQ,EAAE,MAAM,CAAC;IAEjB,8CAA8C;IAC9C,QAAQ,EAAE,MAAM,CAAC;IAEjB,uCAAuC;IACvC,IAAI,EAAE,MAAM,CAAC;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC;IAC5B,oEAAoE;IACpE,MAAM,EAAE,SAAS,EAAE,CAAC;IAEpB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,EAAE,CAAC;IAElB,kDAAkD;IAClD,SAAS,EAAE,CAAC,EAAE,CAAC;IAEf,gDAAgD;IAChD,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;OAIG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAEtC;;;;OAIG;IACH,WAAW,CAAC,cAAc,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;CAC9C;AAED;;;GAGG;AACH,MAAM,WAAW,IAAI,CAAC,CAAC;IACtB,+CAA+C;IAC/C,CAAC,EAAE,MAAM,CAAC;IAEV,0BAA0B;IAC1B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAC;IAEb,0DAA0D;IAC1D,UAAU,EAAE,MAAM,CAAC;IAEnB,kEAAkE;IAClE,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CAC5B;AAED;;;GAGG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC;IACjC,2BAA2B;IAC3B,EAAE,EAAE,WAAW,CAAC;IAEhB,qCAAqC;IACrC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,8BAA8B;IAC9B,UAAU,EAAE,MAAM,CAAC;IAEnB,sDAAsD;IACtD,WAAW,EAAE,OAAO,CAAC;IAErB,6BAA6B;IAC7B,aAAa,EAAE,MAAM,CAAC;IAEtB,gDAAgD;IAChD,WAAW,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC;IAC9B,kEAAkE;IAClE,KAAK,EAAE,SAAS,CAAC;IAEjB,4BAA4B;IAC5B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;IAEb,iEAAiE;IACjE,UAAU,EAAE,MAAM,CAAC;IAEnB,qDAAqD;IACrD,MAAM,EAAE,OAAO,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC/B,wBAAwB;IACxB,EAAE,EAAE,QAAQ,CAAC;IAEb,2BAA2B;IAC3B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,0DAA0D;IAC1D,iBAAiB,EAAE,MAAM,CAAC;IAE1B,mEAAmE;IACnE,gBAAgB,EAAE,MAAM,CAAC;IAEzB,6EAA6E;IAC7E,gBAAgB,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB,CAAC,CAAC;IACxC,sDAAsD;IACtD,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAElB,2DAA2D;IAC3D,cAAc,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvB,4CAA4C;IAC5C,cAAc,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAE/B,oEAAoE;IACpE,aAAa,EAAE,MAAM,CAAC;IAEtB,sEAAsE;IACtE,UAAU,EAAE,MAAM,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,WAAW,oBAAoB,CAAC,CAAC;IACtC,2BAA2B;IAC3B,EAAE,EAAE,WAAW,CAAC;IAEhB,0CAA0C;IAC1C,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,sBAAsB;IACtB,IAAI,EAAE,MAAM,CAAC;IAEb,8DAA8D;IAC9D,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAE3B,yDAAyD;IACzD,QAAQ,EAAE,OAAO,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC9B,kEAAkE;IAClE,UAAU,EAAE,MAAM,CAAC;IAEnB,gEAAgE;IAChE,cAAc,EAAE,MAAM,CAAC;IAEvB,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;IAEnB,2CAA2C;IAC3C,WAAW,EAAE,MAAM,CAAC;IAEpB,yDAAyD;IACzD,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAE/B,2EAA2E;IAC3E,aAAa,EAAE,MAAM,CAAC;CACtB;AAMD;;;;GAIG;AACH,MAAM,WAAW,oBAAoB;IACpC;;;;;;;;;;;OAWG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;IAElC;;;;;;;;;OASG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;;;;;;;;;OAWG;IACH,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAE/B;;;;;;;;;;;;;;;OAeG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,uBAAuB;IACvC;;;;;;;OAOG;IACH,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAChC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,MAAM,kBAAkB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAMrD;;GAEG;AACH,MAAM,MAAM,eAAe,GACvB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,oBAAoB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GACnE;IAAE,IAAI,EAAE,kBAAkB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,uBAAuB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,kBAAkB,GAC1B;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAM/D;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,
|
|
1
|
+
{"version":3,"file":"clustering-types.d.ts","sourceRoot":"","sources":["../../../src/algorithms/types/clustering-types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAMvC;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC;AAE/B;;GAEG;AACH,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAE9B;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC;;;GAGG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;;GAGG;AACH,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC;AAE7B;;;GAGG;AACH,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC;AAEnC;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,MAAM,CAAC;AAEvC;;;GAGG;AACH,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC;AAMtC;;;GAGG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC3B,uCAAuC;IACvC,EAAE,EAAE,WAAW,CAAC;IAEhB,+CAA+C;IAC/C,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,2CAA2C;IAC3C,aAAa,EAAE,MAAM,CAAC;IAEtB,kDAAkD;IAClD,aAAa,EAAE,MAAM,CAAC;IAEtB,8CAA8C;IAC9C,UAAU,EAAE,MAAM,CAAC;IAEnB,4DAA4D;IAC5D,OAAO,EAAE,MAAM,CAAC;IAEhB,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAC;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC3B,sCAAsC;IACtC,EAAE,EAAE,WAAW,CAAC;IAEhB,uCAAuC;IACvC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAC;IAEb,0DAA0D;IAC1D,QAAQ,EAAE,MAAM,CAAC;IAEjB,gDAAgD;IAChD,OAAO,EAAE,MAAM,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS;IACzB,2DAA2D;IAC3D,QAAQ,EAAE,MAAM,CAAC;IAEjB,4DAA4D;IAC5D,QAAQ,EAAE,MAAM,CAAC;IAEjB,8CAA8C;IAC9C,QAAQ,EAAE,MAAM,CAAC;IAEjB,uCAAuC;IACvC,IAAI,EAAE,MAAM,CAAC;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC;IAC5B,oEAAoE;IACpE,MAAM,EAAE,SAAS,EAAE,CAAC;IAEpB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,EAAE,CAAC;IAElB,kDAAkD;IAClD,SAAS,EAAE,CAAC,EAAE,CAAC;IAEf,gDAAgD;IAChD,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;OAIG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAEtC;;;;OAIG;IACH,WAAW,CAAC,cAAc,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;CAC9C;AAED;;;GAGG;AACH,MAAM,WAAW,IAAI,CAAC,CAAC;IACtB,+CAA+C;IAC/C,CAAC,EAAE,MAAM,CAAC;IAEV,0BAA0B;IAC1B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAC;IAEb,0DAA0D;IAC1D,UAAU,EAAE,MAAM,CAAC;IAEnB,kEAAkE;IAClE,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CAC5B;AAED;;;GAGG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC;IACjC,2BAA2B;IAC3B,EAAE,EAAE,WAAW,CAAC;IAEhB,qCAAqC;IACrC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,8BAA8B;IAC9B,UAAU,EAAE,MAAM,CAAC;IAEnB,sDAAsD;IACtD,WAAW,EAAE,OAAO,CAAC;IAErB,6BAA6B;IAC7B,aAAa,EAAE,MAAM,CAAC;IAEtB,gDAAgD;IAChD,WAAW,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC;IAC9B,kEAAkE;IAClE,KAAK,EAAE,SAAS,CAAC;IAEjB,4BAA4B;IAC5B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;IAEb,iEAAiE;IACjE,UAAU,EAAE,MAAM,CAAC;IAEnB,qDAAqD;IACrD,MAAM,EAAE,OAAO,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC/B,wBAAwB;IACxB,EAAE,EAAE,QAAQ,CAAC;IAEb,2BAA2B;IAC3B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,0DAA0D;IAC1D,iBAAiB,EAAE,MAAM,CAAC;IAE1B,mEAAmE;IACnE,gBAAgB,EAAE,MAAM,CAAC;IAEzB,6EAA6E;IAC7E,gBAAgB,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB,CAAC,CAAC;IACxC,sDAAsD;IACtD,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAElB,2DAA2D;IAC3D,cAAc,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvB,4CAA4C;IAC5C,cAAc,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAE/B,oEAAoE;IACpE,aAAa,EAAE,MAAM,CAAC;IAEtB,sEAAsE;IACtE,UAAU,EAAE,MAAM,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,WAAW,oBAAoB,CAAC,CAAC;IACtC,2BAA2B;IAC3B,EAAE,EAAE,WAAW,CAAC;IAEhB,0CAA0C;IAC1C,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,sBAAsB;IACtB,IAAI,EAAE,MAAM,CAAC;IAEb,8DAA8D;IAC9D,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAE3B,yDAAyD;IACzD,QAAQ,EAAE,OAAO,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC9B,kEAAkE;IAClE,UAAU,EAAE,MAAM,CAAC;IAEnB,gEAAgE;IAChE,cAAc,EAAE,MAAM,CAAC;IAEvB,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;IAEnB,2CAA2C;IAC3C,WAAW,EAAE,MAAM,CAAC;IAEpB,yDAAyD;IACzD,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAE/B,2EAA2E;IAC3E,aAAa,EAAE,MAAM,CAAC;CACtB;AAMD;;;;GAIG;AACH,MAAM,WAAW,oBAAoB;IACpC;;;;;;;;;;;OAWG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;IAElC;;;;;;;;;OASG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;;;;;;;;;OAWG;IACH,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAE/B;;;;;;;;;;;;;;;OAeG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,uBAAuB;IACvC;;;;;;;OAOG;IACH,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAChC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,MAAM,kBAAkB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAMrD;;GAEG;AACH,MAAM,MAAM,eAAe,GACvB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,oBAAoB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GACnE;IAAE,IAAI,EAAE,kBAAkB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,uBAAuB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,kBAAkB,GAC1B;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAM/D;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,mBAAmB,CAAC,CAAC,GAAG,MAAM;IAC9C,gDAAgD;IAChD,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvC,8DAA8D;IAC9D,UAAU,EAAE,MAAM,CAAC;IAEnB,uEAAuE;IACvE,MAAM,EAAE,MAAM,CAAC;IAEf,yCAAyC;IACzC,QAAQ,EAAE;QACT,wCAAwC;QACxC,SAAS,EAAE,MAAM,CAAC;QAElB,oCAAoC;QACpC,OAAO,EAAE,MAAM,CAAC;QAEhB,mDAAmD;QACnD,eAAe,EAAE,MAAM,CAAC;QAExB,2DAA2D;QAC3D,aAAa,EAAE,QAAQ,CAAC,oBAAoB,CAAC,CAAC;KAC9C,CAAC;CACF;AAED;;GAEG;AACH,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,MAAM,CACnC;IACC,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC;IAClC,OAAO,EAAE,cAAc,CAAC;IACxB,QAAQ,EAAE;QACT,SAAS,EAAE,QAAQ,CAAC;QACpB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE;YACX,UAAU,CAAC,EAAE,MAAM,CAAC;YACpB,aAAa,CAAC,EAAE,MAAM,CAAC;SACvB,CAAC;KACF,CAAC;CACF,EACD,eAAe,CACf,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,sBAAsB,CAAC,CAAC,IAAI,MAAM,CAC7C;IACC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5B,QAAQ,EAAE;QACT,SAAS,EAAE,mBAAmB,CAAC;QAC/B,OAAO,EAAE,MAAM,CAAC;QAChB,SAAS,EAAE,OAAO,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE;YACX,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,IAAI,CAAC,EAAE,MAAM,CAAC;SACd,CAAC;KACF,CAAC;CACF,EACD,eAAe,CACf,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI,MAAM,CACpC;IACC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5B,OAAO,EAAE,cAAc,CAAC;IACxB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE;QACT,SAAS,EAAE,SAAS,CAAC;QACrB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE;YACX,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,SAAS,CAAC,EAAE,MAAM,CAAC;YACnB,IAAI,CAAC,EAAE,MAAM,CAAC;SACd,CAAC;KACF,CAAC;CACF,EACD,eAAe,CACf,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,uBAAuB,CAAC,CAAC,IAAI,MAAM,CAC9C;IACC,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE;QACT,SAAS,EAAE,UAAU,CAAC;QACtB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE;YACX,CAAC,EAAE,MAAM,CAAC;YACV,gBAAgB,CAAC,EAAE,MAAM,CAAC;SAC1B,CAAC;KACF,CAAC;CACF,EACD,iBAAiB,CACjB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,kBAAkB,CAAC,CAAC,IAAI,MAAM,CACzC;IACC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1B,QAAQ,EAAE;QACT,SAAS,EAAE,cAAc,CAAC;QAC1B,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE;YACX,OAAO,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;SAC3C,CAAC;KACF,CAAC;CACF,EACD,iBAAiB,CACjB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,MAAM,CAClC;IACC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC5B,QAAQ,EAAE;QACT,SAAS,EAAE,QAAQ,CAAC;QACpB,OAAO,EAAE,MAAM,CAAC;KAChB,CAAC;CACF,EACD,kBAAkB,CAClB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,mBAAmB,CAAC,CAAC,IAAI,MAAM,CAC1C;IACC,SAAS,EAAE,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACrC,QAAQ,EAAE;QACT,SAAS,EAAE,gBAAgB,CAAC;QAC5B,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,OAAO,CAAC;QACnB,UAAU,EAAE;YACX,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,OAAO,CAAC,EAAE,MAAM,CAAC;SACjB,CAAC;KACF,CAAC;CACF,EACD,kBAAkB,CAClB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,iBAAiB,CAAC,CAAC,IAAI,MAAM,CACxC;IACC,UAAU,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC;IACtC,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,QAAQ,EAAE;QACT,SAAS,EAAE,aAAa,CAAC;QACzB,OAAO,EAAE,MAAM,CAAC;KAChB,CAAC;CACF,EACD,kBAAkB,CAClB,CAAC"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"csr.d.ts","sourceRoot":"","sources":["../../../src/algorithms/utils/csr.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,KAAK,IAAI,EAAC,KAAK,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI;IACvD;;;;;;;OAOG;IACH,OAAO,EAAE,WAAW,CAAC;IAErB;;;;;;;OAOG;IACH,KAAK,EAAE,WAAW,CAAC;IAEnB;;;;;;;OAOG;IACH,OAAO,EAAE,YAAY,CAAC;IAEtB;;;;;;;OAOG;IACH,OAAO,EAAE,MAAM,EAAE,CAAC;IAElB;;;;;;;OAOG;IACH,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAE/B;;;;;OAKG;IACH,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACnB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,eAAO,MAAM,YAAY,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,
|
|
1
|
+
{"version":3,"file":"csr.d.ts","sourceRoot":"","sources":["../../../src/algorithms/utils/csr.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,KAAK,IAAI,EAAC,KAAK,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI;IACvD;;;;;;;OAOG;IACH,OAAO,EAAE,WAAW,CAAC;IAErB;;;;;;;OAOG;IACH,KAAK,EAAE,WAAW,CAAC;IAEnB;;;;;;;OAOG;IACH,OAAO,EAAE,YAAY,CAAC;IAEtB;;;;;;;OAOG;IACH,OAAO,EAAE,MAAM,EAAE,CAAC;IAElB;;;;;;;OAOG;IACH,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAE/B;;;;;OAKG;IACH,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACnB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,eAAO,MAAM,YAAY,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CA+F9F,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"csr.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/utils/csr.unit.test.ts"],"names":[],"mappings":""}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"type-guards.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/utils/type-guards.unit.test.ts"],"names":[],"mappings":""}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"validators.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/utils/validators.unit.test.ts"],"names":[],"mappings":""}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"advanced-props.d.ts","sourceRoot":"","sources":["../../src/analyzer/advanced-props.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EACX,aAAa,EACb,aAAa,EACb,MAAM,SAAS,CAAC;AAKjB,eAAO,MAAM,gBAAgB,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,wBAAwB,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,qBAAqB,CAAC;IAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAA;
|
|
1
|
+
{"version":3,"file":"advanced-props.d.ts","sourceRoot":"","sources":["../../src/analyzer/advanced-props.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EACX,aAAa,EACb,aAAa,EACb,MAAM,SAAS,CAAC;AAKjB,eAAO,MAAM,gBAAgB,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,wBAAwB,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,qBAAqB,CAAC;IAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAA;CAwBhL,CAAC;AAEF,eAAO,MAAM,cAAc,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,cAAc,CAAA;CAS1I,CAAC;AAEF,eAAO,MAAM,eAAe,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KACnE;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,GAClB;IAAE,IAAI,EAAE,mBAAmB,CAAA;CAAE,GAC7B;IAAE,IAAI,EAAE,gBAAgB,CAAA;CAAE,GAC1B;IAAE,IAAI,EAAE,mBAAmB,CAAA;CAAE,GAC7B;IAAE,IAAI,EAAE,cAAc,CAAA;CAkBzB,CAAC;AAEF,eAAO,MAAM,eAAe,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KACnE;IAAE,IAAI,EAAE,cAAc,CAAA;CAAE,GACxB;IAAE,IAAI,EAAE,aAAa,CAAA;CAAE,GACvB;IAAE,IAAI,EAAE,WAAW,CAAA;CAAE,GACrB;IAAE,IAAI,EAAE,gBAAgB,CAAA;CAc3B,CAAC;AAEF,eAAO,MAAM,mBAAmB,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,WAAW,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,SAAS,CAAA;CAItH,CAAC;AAEF,eAAO,MAAM,YAAY,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,wBAAwB,CAAA;CAIzH,CAAC;AAEF,eAAO,MAAM,oBAAoB,GAAI,GAAG,aAAa,KAAG;IAAE,IAAI,EAAE,iBAAiB,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,oBAAoB,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,oBAAoB,CAAA;CAiBlJ,CAAC;AAEF,eAAO,MAAM,2BAA2B,GAAI,GAAG,aAAa,KACxD;IAAE,IAAI,EAAE,iBAAiB,CAAA;CAAE,GAC3B;IAAE,IAAI,EAAE,0BAA0B,CAAA;CAAE,GACpC;IAAE,IAAI,EAAE,YAAY,CAAA;CAevB,CAAC;AAEF,eAAO,MAAM,uBAAuB,GAAI,GAAG,aAAa,KAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,SAAS,CAAA;CAmBtI,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"advanced-props.unit.test.d.ts","sourceRoot":"","sources":["../../src/analyzer/advanced-props.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"advanced-structures.unit.test.d.ts","sourceRoot":"","sources":["../../src/analyzer/advanced-structures.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"connectivity.unit.test.d.ts","sourceRoot":"","sources":["../../src/analyzer/connectivity.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"core-props.unit.test.d.ts","sourceRoot":"","sources":["../../src/analyzer/core-props.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}
|
|
@@ -0,0 +1,59 @@
|
|
|
1
|
+
import { ATFree, BullFree, C5Free, DistanceHereditary, GemFree, HHFree, P5Free, WeaklyChordal } from '../generation/spec/forbidden-subgraph.js';
|
|
2
|
+
import { AnalyzerGraph, ComputePolicy } from './types.js';
|
|
3
|
+
/**
|
|
4
|
+
* Compute P5Free property from graph structure.
|
|
5
|
+
* Contains no induced path on 5 vertices
|
|
6
|
+
* @param g
|
|
7
|
+
* @param _policy
|
|
8
|
+
*/
|
|
9
|
+
export declare const computeP5Free: (g: AnalyzerGraph, _policy: ComputePolicy) => P5Free;
|
|
10
|
+
/**
|
|
11
|
+
* Compute C5Free property from graph structure.
|
|
12
|
+
* Contains no induced cycle on 5 vertices
|
|
13
|
+
* @param g
|
|
14
|
+
* @param _policy
|
|
15
|
+
*/
|
|
16
|
+
export declare const computeC5Free: (g: AnalyzerGraph, _policy: ComputePolicy) => C5Free;
|
|
17
|
+
/**
|
|
18
|
+
* Compute BullFree property from graph structure.
|
|
19
|
+
* Contains no induced bull graph
|
|
20
|
+
* @param g
|
|
21
|
+
* @param _policy
|
|
22
|
+
*/
|
|
23
|
+
export declare const computeBullFree: (g: AnalyzerGraph, _policy: ComputePolicy) => BullFree;
|
|
24
|
+
/**
|
|
25
|
+
* Compute GemFree property from graph structure.
|
|
26
|
+
* Contains no induced gem graph
|
|
27
|
+
* @param g
|
|
28
|
+
* @param _policy
|
|
29
|
+
*/
|
|
30
|
+
export declare const computeGemFree: (g: AnalyzerGraph, _policy: ComputePolicy) => GemFree;
|
|
31
|
+
/**
|
|
32
|
+
* Compute ATFree property from graph structure.
|
|
33
|
+
* No asteroidal triple of vertices
|
|
34
|
+
* @param g
|
|
35
|
+
* @param _policy
|
|
36
|
+
*/
|
|
37
|
+
export declare const computeATFree: (g: AnalyzerGraph, _policy: ComputePolicy) => ATFree;
|
|
38
|
+
/**
|
|
39
|
+
* Compute HHFree property from graph structure.
|
|
40
|
+
* No induced house or hole (cycle of length >= 5)
|
|
41
|
+
* @param g
|
|
42
|
+
* @param _policy
|
|
43
|
+
*/
|
|
44
|
+
export declare const computeHHFree: (g: AnalyzerGraph, _policy: ComputePolicy) => HHFree;
|
|
45
|
+
/**
|
|
46
|
+
* Compute DistanceHereditary property from graph structure.
|
|
47
|
+
* Distances preserved in all connected induced subgraphs
|
|
48
|
+
* @param g
|
|
49
|
+
* @param _policy
|
|
50
|
+
*/
|
|
51
|
+
export declare const computeDistanceHereditary: (g: AnalyzerGraph, _policy: ComputePolicy) => DistanceHereditary;
|
|
52
|
+
/**
|
|
53
|
+
* Compute WeaklyChordal property from graph structure.
|
|
54
|
+
* No induced hole or anti-hole of length >= 5
|
|
55
|
+
* @param g
|
|
56
|
+
* @param _policy
|
|
57
|
+
*/
|
|
58
|
+
export declare const computeWeaklyChordal: (g: AnalyzerGraph, _policy: ComputePolicy) => WeaklyChordal;
|
|
59
|
+
//# sourceMappingURL=forbidden-subgraph.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"forbidden-subgraph.d.ts","sourceRoot":"","sources":["../../src/analyzer/forbidden-subgraph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,OAAO,KAAK,EACX,MAAM,EACN,QAAQ,EACR,MAAM,EACN,kBAAkB,EAClB,OAAO,EACP,MAAM,EACN,MAAM,EACN,aAAa,EACb,MAAM,0CAA0C,CAAC;AAMlD,OAAO,KAAK,EAAE,aAAa,EAAG,aAAa,EAAE,MAAM,YAAY,CAAC;AAuDhE;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GACzB,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,MAKF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GACzB,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,MAKF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,eAAe,GAC3B,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,QAKF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,cAAc,GAC1B,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,OAKF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GACzB,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,MAiBF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GACzB,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,MAyBF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,yBAAyB,GACrC,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,kBAiBF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,oBAAoB,GAChC,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,aAyDF,CAAC"}
|
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
import { Planar } from '../generation/spec/geometric.js';
|
|
2
|
+
import { AnalyzerGraph, ComputePolicy } from './types.js';
|
|
3
|
+
/**
|
|
4
|
+
* Compute Planar property from graph structure.
|
|
5
|
+
* A graph is planar if it can be drawn in the plane without edge crossings.
|
|
6
|
+
*
|
|
7
|
+
* Uses Kuratowski's theorem: A graph is planar iff it contains no subdivision
|
|
8
|
+
* of K5 or K3,3 (complete graph on 5 vertices or complete bipartite 3,3).
|
|
9
|
+
*
|
|
10
|
+
* Detection strategy:
|
|
11
|
+
* 1. Trivial cases (n < 5): Always planar
|
|
12
|
+
* 2. Edge count heuristic: If m > 3n - 6, then nonplanar (necessary condition)
|
|
13
|
+
* 3. For small graphs (n <= 10): Check for K5 and K3,3 subgraphs
|
|
14
|
+
* 4. For large graphs: Return unconstrained if heuristic passes
|
|
15
|
+
*
|
|
16
|
+
* @param g - Analyzer graph
|
|
17
|
+
* @param _policy - Computation policy (unused)
|
|
18
|
+
* @returns Planar property: "planar", "nonplanar", or "unconstrained"
|
|
19
|
+
*/
|
|
20
|
+
export declare const computePlanar: (g: AnalyzerGraph, _policy?: ComputePolicy) => Planar;
|
|
21
|
+
//# sourceMappingURL=geometric.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"geometric.d.ts","sourceRoot":"","sources":["../../src/analyzer/geometric.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,OAAO,KAAK,EACX,MAAM,EACN,MAAM,iCAAiC,CAAC;AACzC,OAAO,KAAK,EAAE,aAAa,EAAG,aAAa,EAAE,MAAM,YAAY,CAAC;AA6NhE;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,aAAa,GACzB,GAAG,aAAa,EAChB,UAAU,aAAa,KACrB,MAsEF,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"geometric.unit.test.d.ts","sourceRoot":"","sources":["../../src/analyzer/geometric.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}
|
|
@@ -4,4 +4,6 @@
|
|
|
4
4
|
* This file aggregates and re-exports all analyzer types, policies, and helpers.
|
|
5
5
|
* Individual modules are not meant to be imported directly.
|
|
6
6
|
*/
|
|
7
|
+
/** Sentinel constant indicating this module is loaded. */
|
|
8
|
+
export declare const HELPERS_MODULE = true;
|
|
7
9
|
//# sourceMappingURL=helpers.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../src/analyzer/helpers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}
|
|
1
|
+
{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../src/analyzer/helpers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,0DAA0D;AAC1D,eAAO,MAAM,cAAc,OAAO,CAAC"}
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Unit tests for helpers.ts
|
|
3
|
+
*
|
|
4
|
+
* Note: helpers.ts is currently empty (contains only comments).
|
|
5
|
+
* This test file is a placeholder that documents this and provides
|
|
6
|
+
* a structure for future tests if functions are added to helpers.ts.
|
|
7
|
+
*/
|
|
8
|
+
export {};
|
|
9
|
+
//# sourceMappingURL=helpers.unit.test.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"helpers.unit.test.d.ts","sourceRoot":"","sources":["../../src/analyzer/helpers.unit.test.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}
|
|
@@ -0,0 +1,17 @@
|
|
|
1
|
+
import { CircularArc, ProperCircularArc } from '../generation/spec/intersection.js';
|
|
2
|
+
import { AnalyzerGraph, ComputePolicy } from './types.js';
|
|
3
|
+
/**
|
|
4
|
+
* Compute CircularArc property from graph structure.
|
|
5
|
+
* Intersection graph of arcs on a circle
|
|
6
|
+
* @param g
|
|
7
|
+
* @param _policy
|
|
8
|
+
*/
|
|
9
|
+
export declare const computeCircularArc: (g: AnalyzerGraph, _policy: ComputePolicy) => CircularArc;
|
|
10
|
+
/**
|
|
11
|
+
* Compute ProperCircularArc property from graph structure.
|
|
12
|
+
* Circular arc graph with no arc containment
|
|
13
|
+
* @param g
|
|
14
|
+
* @param _policy
|
|
15
|
+
*/
|
|
16
|
+
export declare const computeProperCircularArc: (g: AnalyzerGraph, _policy: ComputePolicy) => ProperCircularArc;
|
|
17
|
+
//# sourceMappingURL=intersection.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"intersection.d.ts","sourceRoot":"","sources":["../../src/analyzer/intersection.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EACX,WAAW,EACX,iBAAiB,EACjB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAgL/D;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,GAC9B,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,WAIF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,wBAAwB,GACpC,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,iBAIF,CAAC"}
|
package/dist/analyzer/main.d.ts
CHANGED
|
@@ -2,8 +2,14 @@ import { computeEdgeOrdering, computeEmbedding, computeLayering, computeMeasureS
|
|
|
2
2
|
import { computeAutoRegular, computeClawFree, computeCograph, computeCompleteBipartite, computeCubic, computeLine, computePerfect, computeSelfComplementary, computeSplit, computeStronglyRegular, computeThreshold, computeVertexTransitive } from './advanced-structures';
|
|
3
3
|
import { computeConnectivity, computeCycles, computeDegreeConstraint } from './connectivity';
|
|
4
4
|
import { computeDirectionality, computeEdgeArity, computeEdgeData, computeEdgeMultiplicity, computeSchemaHomogeneity, computeSelfLoops, computeSignedness, computeUncertainty, computeVertexCardinality, computeVertexData, computeVertexIdentity, computeVertexOrdering, computeWeighting } from './core-props';
|
|
5
|
+
import { computeATFree, computeBullFree, computeC5Free, computeDistanceHereditary, computeGemFree, computeHHFree, computeP5Free } from './forbidden-subgraph';
|
|
6
|
+
import { computePlanar } from './geometric';
|
|
7
|
+
import { computeCircularArc, computeProperCircularArc } from './intersection';
|
|
5
8
|
import { computeHamiltonian, computeTraceable } from './path-props';
|
|
9
|
+
import { computeModular, computePtolemaic, computeQuasiLine } from './perfect-variants';
|
|
10
|
+
import { computeProbeChordal, computeProbeInterval } from './probe';
|
|
6
11
|
import { computeCommunityStructure, computeScaleFree, computeSmallWorld } from './spectral';
|
|
12
|
+
import { computeWeaklyChordal } from './structural';
|
|
7
13
|
import { computeCompleteness, computeDensity, computePartiteness } from './structure';
|
|
8
14
|
import { AnalyzerGraph, ComputePolicy } from './types';
|
|
9
15
|
export type InferredGraphSpec = Readonly<{
|
|
@@ -46,6 +52,22 @@ export type InferredGraphSpec = Readonly<{
|
|
|
46
52
|
threshold: ReturnType<typeof computeThreshold>;
|
|
47
53
|
line: ReturnType<typeof computeLine>;
|
|
48
54
|
clawFree: ReturnType<typeof computeClawFree>;
|
|
55
|
+
modular: ReturnType<typeof computeModular>;
|
|
56
|
+
ptolemaic: ReturnType<typeof computePtolemaic>;
|
|
57
|
+
quasiLine: ReturnType<typeof computeQuasiLine>;
|
|
58
|
+
p5Free: ReturnType<typeof computeP5Free>;
|
|
59
|
+
c5Free: ReturnType<typeof computeC5Free>;
|
|
60
|
+
bullFree: ReturnType<typeof computeBullFree>;
|
|
61
|
+
gemFree: ReturnType<typeof computeGemFree>;
|
|
62
|
+
atFree: ReturnType<typeof computeATFree>;
|
|
63
|
+
hhFree: ReturnType<typeof computeHHFree>;
|
|
64
|
+
distanceHereditary: ReturnType<typeof computeDistanceHereditary>;
|
|
65
|
+
weaklyChordal: ReturnType<typeof computeWeaklyChordal>;
|
|
66
|
+
circularArc: ReturnType<typeof computeCircularArc>;
|
|
67
|
+
properCircularArc: ReturnType<typeof computeProperCircularArc>;
|
|
68
|
+
probeChordal: ReturnType<typeof computeProbeChordal>;
|
|
69
|
+
probeInterval: ReturnType<typeof computeProbeInterval>;
|
|
70
|
+
planarNew: ReturnType<typeof computePlanar>;
|
|
49
71
|
cubic: ReturnType<typeof computeCubic>;
|
|
50
72
|
specificRegular: ReturnType<typeof computeAutoRegular>;
|
|
51
73
|
stronglyRegular: ReturnType<typeof computeStronglyRegular>;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"main.d.ts","sourceRoot":"","sources":["../../src/analyzer/main.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACN,mBAAmB,EACnB,gBAAgB,EAChB,eAAe,EACf,uBAAuB,EACvB,oBAAoB,EACpB,2BAA2B,EAC3B,YAAY,EACZ,cAAc,EACd,eAAe,EAAC,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EACN,kBAAkB,EAClB,eAAe,EACf,cAAc,EACd,wBAAwB,EACxB,YAAY,EACZ,WAAW,EACX,cAAc,EACd,wBAAwB,EACxB,YAAY,EACZ,sBAAsB,EACtB,gBAAgB,EAChB,uBAAuB,EAAC,MAAM,uBAAuB,CAAC;AACvD,OAAO,EACN,mBAAmB,EACnB,aAAa,EACb,uBAAuB,EACvB,MAAM,gBAAgB,CAAC;AAExB,OAAO,EACN,qBAAqB,EACrB,gBAAgB,EAChB,eAAe,EACf,uBAAuB,EACvB,wBAAwB,EACxB,gBAAgB,EAChB,iBAAiB,EACjB,kBAAkB,EAClB,wBAAwB,EACxB,iBAAiB,EACjB,qBAAqB,EACrB,qBAAqB,EACrB,gBAAgB,EAAC,MAAM,cAAc,CAAC;AACvC,OAAO,EACN,kBAAkB,EAClB,gBAAgB,EAChB,MAAM,cAAc,CAAC;AACtB,OAAO,EACN,yBAAyB,EACzB,gBAAgB,EAChB,iBAAiB,EAAC,MAAM,YAAY,CAAC;AACtC,OAAO,EACN,mBAAmB,EACnB,cAAc,EACd,kBAAkB,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,KAAK,EACX,aAAa,EACb,aAAa,EAAC,MAAM,SAAS,CAAC;AAW/B,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACxC,iBAAiB,EAAE,UAAU,CAAC,OAAO,wBAAwB,CAAC,CAAC;IAC/D,cAAc,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC;IACzD,cAAc,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC;IAEzD,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,gBAAgB,EAAE,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC;IAC7D,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAE/C,cAAc,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC;IAEzD,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,UAAU,EAAE,UAAU,CAAC,OAAO,iBAAiB,CAAC,CAAC;IACjD,WAAW,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC;IAEnD,UAAU,EAAE,UAAU,CAAC,OAAO,iBAAiB,CAAC,CAAC;IACjD,QAAQ,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,CAAC;IAC7C,MAAM,EAAE,UAAU,CAAC,OAAO,wBAAwB,CAAC,CAAC;IAEpD,YAAY,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC;IACrD,MAAM,EAAE,UAAU,CAAC,OAAO,aAAa,CAAC,CAAC;IACzC,gBAAgB,EAAE,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC;IAC7D,YAAY,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC;IACrD,WAAW,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC;IACnD,OAAO,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;IAE3C,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,OAAO,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;IAC3C,QAAQ,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,CAAC;IAC7C,QAAQ,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,CAAC;IAC7C,YAAY,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC;IACrD,KAAK,EAAE,UAAU,CAAC,OAAO,YAAY,CAAC,CAAC;IAEvC,aAAa,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC;IACvD,oBAAoB,EAAE,UAAU,CAAC,OAAO,2BAA2B,CAAC,CAAC;IACrE,gBAAgB,EAAE,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC;IAG7D,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,UAAU,EAAE,UAAU,CAAC,OAAO,iBAAiB,CAAC,CAAC;IACjD,kBAAkB,EAAE,UAAU,CAAC,OAAO,yBAAyB,CAAC,CAAC;IAGjE,WAAW,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC;IACnD,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAG/C,OAAO,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;IAC3C,KAAK,EAAE,UAAU,CAAC,OAAO,YAAY,CAAC,CAAC;IACvC,OAAO,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;IAC3C,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,IAAI,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,CAAC;IACrC,QAAQ,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,CAAC;IAG7C,KAAK,EAAE,UAAU,CAAC,OAAO,YAAY,CAAC,CAAC;IACvC,eAAe,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC;IACvD,eAAe,EAAE,UAAU,CAAC,OAAO,sBAAsB,CAAC,CAAC;IAG3D,iBAAiB,EAAE,UAAU,CAAC,OAAO,wBAAwB,CAAC,CAAC;IAC/D,gBAAgB,EAAE,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC;IAG7D,iBAAiB,EAAE,UAAU,CAAC,OAAO,wBAAwB,CAAC,CAAC;CAC/D,CAAC,CAAC;AAMH,eAAO,MAAM,yBAAyB,GAAI,GAAG,aAAa,EAAE,SAAQ,OAAO,CAAC,aAAa,CAAM,KAAG,
|
|
1
|
+
{"version":3,"file":"main.d.ts","sourceRoot":"","sources":["../../src/analyzer/main.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACN,mBAAmB,EACnB,gBAAgB,EAChB,eAAe,EACf,uBAAuB,EACvB,oBAAoB,EACpB,2BAA2B,EAC3B,YAAY,EACZ,cAAc,EACd,eAAe,EAAC,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EACN,kBAAkB,EAClB,eAAe,EACf,cAAc,EACd,wBAAwB,EACxB,YAAY,EACZ,WAAW,EACX,cAAc,EACd,wBAAwB,EACxB,YAAY,EACZ,sBAAsB,EACtB,gBAAgB,EAChB,uBAAuB,EAAC,MAAM,uBAAuB,CAAC;AACvD,OAAO,EACN,mBAAmB,EACnB,aAAa,EACb,uBAAuB,EACvB,MAAM,gBAAgB,CAAC;AAExB,OAAO,EACN,qBAAqB,EACrB,gBAAgB,EAChB,eAAe,EACf,uBAAuB,EACvB,wBAAwB,EACxB,gBAAgB,EAChB,iBAAiB,EACjB,kBAAkB,EAClB,wBAAwB,EACxB,iBAAiB,EACjB,qBAAqB,EACrB,qBAAqB,EACrB,gBAAgB,EAAC,MAAM,cAAc,CAAC;AACvC,OAAO,EACN,aAAa,EACb,eAAe,EACf,aAAa,EACb,yBAAyB,EACzB,cAAc,EACd,aAAa,EACb,aAAa,EACb,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACN,aAAa,EACb,MAAM,aAAa,CAAC;AACrB,OAAO,EACN,kBAAkB,EAClB,wBAAwB,EACxB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACN,kBAAkB,EAClB,gBAAgB,EAChB,MAAM,cAAc,CAAC;AACtB,OAAO,EACN,cAAc,EACd,gBAAgB,EAChB,gBAAgB,EAChB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACN,mBAAmB,EACnB,oBAAoB,EACpB,MAAM,SAAS,CAAC;AACjB,OAAO,EACN,yBAAyB,EACzB,gBAAgB,EAChB,iBAAiB,EAAC,MAAM,YAAY,CAAC;AACtC,OAAO,EACN,oBAAoB,EACpB,MAAM,cAAc,CAAC;AACtB,OAAO,EACN,mBAAmB,EACnB,cAAc,EACd,kBAAkB,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,KAAK,EACX,aAAa,EACb,aAAa,EAAC,MAAM,SAAS,CAAC;AAW/B,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACxC,iBAAiB,EAAE,UAAU,CAAC,OAAO,wBAAwB,CAAC,CAAC;IAC/D,cAAc,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC;IACzD,cAAc,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC;IAEzD,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,gBAAgB,EAAE,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC;IAC7D,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAE/C,cAAc,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC;IAEzD,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,UAAU,EAAE,UAAU,CAAC,OAAO,iBAAiB,CAAC,CAAC;IACjD,WAAW,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC;IAEnD,UAAU,EAAE,UAAU,CAAC,OAAO,iBAAiB,CAAC,CAAC;IACjD,QAAQ,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,CAAC;IAC7C,MAAM,EAAE,UAAU,CAAC,OAAO,wBAAwB,CAAC,CAAC;IAEpD,YAAY,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC;IACrD,MAAM,EAAE,UAAU,CAAC,OAAO,aAAa,CAAC,CAAC;IACzC,gBAAgB,EAAE,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC;IAC7D,YAAY,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC;IACrD,WAAW,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC;IACnD,OAAO,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;IAE3C,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,OAAO,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;IAC3C,QAAQ,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,CAAC;IAC7C,QAAQ,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,CAAC;IAC7C,YAAY,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC;IACrD,KAAK,EAAE,UAAU,CAAC,OAAO,YAAY,CAAC,CAAC;IAEvC,aAAa,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC;IACvD,oBAAoB,EAAE,UAAU,CAAC,OAAO,2BAA2B,CAAC,CAAC;IACrE,gBAAgB,EAAE,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC;IAG7D,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,UAAU,EAAE,UAAU,CAAC,OAAO,iBAAiB,CAAC,CAAC;IACjD,kBAAkB,EAAE,UAAU,CAAC,OAAO,yBAAyB,CAAC,CAAC;IAGjE,WAAW,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC;IACnD,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAG/C,OAAO,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;IAC3C,KAAK,EAAE,UAAU,CAAC,OAAO,YAAY,CAAC,CAAC;IACvC,OAAO,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;IAC3C,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,IAAI,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,CAAC;IACrC,QAAQ,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,CAAC;IAG7C,OAAO,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;IAC3C,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAC/C,SAAS,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IAG/C,MAAM,EAAE,UAAU,CAAC,OAAO,aAAa,CAAC,CAAC;IACzC,MAAM,EAAE,UAAU,CAAC,OAAO,aAAa,CAAC,CAAC;IACzC,QAAQ,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,CAAC;IAC7C,OAAO,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;IAC3C,MAAM,EAAE,UAAU,CAAC,OAAO,aAAa,CAAC,CAAC;IACzC,MAAM,EAAE,UAAU,CAAC,OAAO,aAAa,CAAC,CAAC;IACzC,kBAAkB,EAAE,UAAU,CAAC,OAAO,yBAAyB,CAAC,CAAC;IACjE,aAAa,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC;IAGvD,WAAW,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC;IACnD,iBAAiB,EAAE,UAAU,CAAC,OAAO,wBAAwB,CAAC,CAAC;IAG/D,YAAY,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC;IACrD,aAAa,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC;IAGvD,SAAS,EAAE,UAAU,CAAC,OAAO,aAAa,CAAC,CAAC;IAG5C,KAAK,EAAE,UAAU,CAAC,OAAO,YAAY,CAAC,CAAC;IACvC,eAAe,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC;IACvD,eAAe,EAAE,UAAU,CAAC,OAAO,sBAAsB,CAAC,CAAC;IAG3D,iBAAiB,EAAE,UAAU,CAAC,OAAO,wBAAwB,CAAC,CAAC;IAC/D,gBAAgB,EAAE,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC;IAG7D,iBAAiB,EAAE,UAAU,CAAC,OAAO,wBAAwB,CAAC,CAAC;CAC/D,CAAC,CAAC;AAMH,eAAO,MAAM,yBAAyB,GAAI,GAAG,aAAa,EAAE,SAAQ,OAAO,CAAC,aAAa,CAAM,KAAG,iBAgGjG,CAAA"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"main.unit.test.d.ts","sourceRoot":"","sources":["../../src/analyzer/main.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"path-props.unit.test.d.ts","sourceRoot":"","sources":["../../src/analyzer/path-props.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}
|
|
@@ -0,0 +1,49 @@
|
|
|
1
|
+
import { Modular, Ptolemaic, QuasiLine } from '../generation/spec/perfect-variants';
|
|
2
|
+
import { AnalyzerGraph, ComputePolicy } from './types.js';
|
|
3
|
+
/**
|
|
4
|
+
* Compute Modular property from graph structure.
|
|
5
|
+
* Every module is trivial (no twin vertices with identical neighborhoods)
|
|
6
|
+
*
|
|
7
|
+
* A modular graph has no non-trivial modules. Two vertices form a module if they
|
|
8
|
+
* have identical external neighborhoods.
|
|
9
|
+
*
|
|
10
|
+
* For small graphs (n <= 10): Exhaustive pairwise comparison
|
|
11
|
+
* For large graphs: Heuristic twin-finding (may return unconstrained for complex cases)
|
|
12
|
+
*
|
|
13
|
+
* @param g - Analyzer graph
|
|
14
|
+
* @param _policy - Computation policy (unused)
|
|
15
|
+
* @returns Modular property: "modular", "not_modular", or "unconstrained"
|
|
16
|
+
*/
|
|
17
|
+
export declare const computeModular: (g: AnalyzerGraph, _policy?: ComputePolicy) => Modular;
|
|
18
|
+
/**
|
|
19
|
+
* Compute Ptolemaic property from graph structure.
|
|
20
|
+
* Ptolemaic graphs are both distance-hereditary AND chordal.
|
|
21
|
+
*
|
|
22
|
+
* A graph is Ptolemaic if and only if it satisfies both:
|
|
23
|
+
* 1. Distance-hereditary: No induced house, hole, domino, or gem
|
|
24
|
+
* 2. Chordal: No induced cycle of length >= 4
|
|
25
|
+
*
|
|
26
|
+
* Equivalently: Ptolemaic = chordal + distance-hereditary
|
|
27
|
+
*
|
|
28
|
+
* @param g - Analyzer graph
|
|
29
|
+
* @param _policy - Computation policy (unused)
|
|
30
|
+
* @returns Ptolemaic property: "ptolemaic" or "not_ptolemaic"
|
|
31
|
+
*/
|
|
32
|
+
export declare const computePtolemaic: (g: AnalyzerGraph, _policy?: ComputePolicy) => Ptolemaic;
|
|
33
|
+
/**
|
|
34
|
+
* Compute QuasiLine property from graph structure.
|
|
35
|
+
* Quasi-line graphs have no induced gem and no induced co-gem.
|
|
36
|
+
*
|
|
37
|
+
* A gem is a graph with 5 vertices: P4 (path of length 4) plus a universal vertex
|
|
38
|
+
* connected to all vertices of the P4. The co-gem is the complement of the gem.
|
|
39
|
+
*
|
|
40
|
+
* Detection strategy:
|
|
41
|
+
* 1. Check for induced gem
|
|
42
|
+
* 2. Check for induced co-gem (gem in complement graph)
|
|
43
|
+
*
|
|
44
|
+
* @param g - Analyzer graph
|
|
45
|
+
* @param _policy - Computation policy (unused)
|
|
46
|
+
* @returns QuasiLine property: "quasi_line" or "not_quasi_line"
|
|
47
|
+
*/
|
|
48
|
+
export declare const computeQuasiLine: (g: AnalyzerGraph, _policy?: ComputePolicy) => QuasiLine;
|
|
49
|
+
//# sourceMappingURL=perfect-variants.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"perfect-variants.d.ts","sourceRoot":"","sources":["../../src/analyzer/perfect-variants.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,OAAO,KAAK,EACX,OAAO,EACP,SAAS,EACT,SAAS,EACT,MAAM,qCAAqC,CAAC;AAE7C,OAAO,KAAK,EAAE,aAAa,EAAG,aAAa,EAAE,MAAM,YAAY,CAAC;AA4HhE;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,cAAc,GAC1B,GAAG,aAAa,EAChB,UAAU,aAAa,KACrB,OA0CF,CAAC;AAEF;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,gBAAgB,GAC5B,GAAG,aAAa,EAChB,UAAU,aAAa,KACrB,SA2BF,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,gBAAgB,GAC5B,GAAG,aAAa,EAChB,UAAU,aAAa,KACrB,SA2BF,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"perfect-variants.unit.test.d.ts","sourceRoot":"","sources":["../../src/analyzer/perfect-variants.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}
|