import { GraphSpec } from '../spec';
import { SeededRandom, TestEdge, TestNode } from './types';
export { computeAndStoreAlgebraicConnectivity, computeAndStoreSpectralRadius, computeAndStoreSpectrum, } from './spectral';
/**
 * Compute and store toughness graph property.
 * Toughness measures graph resilience to vertex removal.
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreToughness: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
/**
 * Compute and store integrity (resilience measure).
 * Integrity minimizes (removed vertices + largest remaining component).
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreIntegrity: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
/**
 * Compute and store cage graph classification.
 * Cage graphs have minimal vertices for given (girth, degree).
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreCage: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
/**
 * Compute and store Moore graph classification.
 * Moore graphs achieve maximum vertices for given (diameter, degree).
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreMooreGraph: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
/**
 * Compute and store Ramanujan graph classification.
 * Ramanujan graphs are optimal expanders with spectral gap property.
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreRamanujan: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
/**
 * Compute and store Cartesian product classification.
 * Cartesian product G □ H combines two graphs.
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreCartesianProduct: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
/**
 * Compute and store tensor (direct) product classification.
 * Tensor product G × H combines two graphs.
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreTensorProduct: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
/**
 * Compute and store strong product classification.
 * Strong product G ⊠ H combines two graphs.
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreStrongProduct: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
/**
 * Compute and store lexicographic product classification.
 * Lexicographic product G ∘ H combines two graphs.
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreLexicographicProduct: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
/**
 * Compute and store minor-free graph classification.
 * Minor-free graphs exclude specific graph minors (Kuratowski-Wagner theorem).
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreMinorFree: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
/**
 * Compute and store topological minor-free classification.
 * Topological minor-free graphs exclude specific subdivisions.
 * @param nodes - Graph nodes
 * @param edges - Graph edges
 * @param spec - Graph specification
 * @param _rng - Seeded random number generator (unused)
 */
export declare const computeAndStoreTopologicalMinorFree: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, _rng: SeededRandom) => void;
//# sourceMappingURL=property-computers.d.ts.map