import { GraphSpec } from '../spec.js'; import { SeededRandom, TestEdge, TestNode } from './types.js'; /** * Generate P5Free edges. * Contains no induced path on 5 vertices * Uses cograph construction (P4-free implies P5-free). * @param nodes * @param edges * @param spec * @param rng */ export declare const generateP5FreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void; /** * Generate C5Free edges. * Contains no induced cycle on 5 vertices * Uses chordal graph construction (no induced cycles >= 4). * @param nodes * @param edges * @param spec * @param rng */ export declare const generateC5FreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void; /** * Generate BullFree edges. * Contains no induced bull graph * Uses split graph construction (clique + independent set). * @param nodes * @param edges * @param spec * @param rng */ export declare const generateBullFreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void; /** * Generate GemFree edges. * Contains no induced gem graph * Gem is a P4 with a chord, so generate chordal graph avoiding gem. * @param nodes * @param edges * @param spec * @param rng */ export declare const generateGemFreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void; /** * Generate ATFree edges. * No asteroidal triple of vertices * Uses caterpillar tree construction. * @param nodes * @param edges * @param spec * @param rng */ export declare const generateATFreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void; /** * Generate HHFree edges. * No induced house or hole * Uses chordal graph construction (which is HH-free). * @param nodes * @param edges * @param spec * @param rng */ export declare const generateHHFreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void; /** * Generate DistanceHereditary edges. * Distances preserved in all connected induced subgraphs * Uses tree construction (trees are distance-hereditary). * @param nodes * @param edges * @param spec * @param rng */ export declare const generateDistanceHereditaryEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void; /** * Generate WeaklyChordal edges. * No induced hole or anti-hole of length >= 5 * Uses split graph construction (which is weakly chordal). * @param nodes * @param edges * @param spec * @param rng */ export declare const generateWeaklyChordalEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void; //# sourceMappingURL=forbidden-subgraph.d.ts.map