import { TestGraph } from '../generation/generators/types';
import { PropertyValidationResult } from './types';
/**
 * Validates graph density and completeness properties.
 *
 * A complete graph has density = 1.0 (all possible edges exist).
 * Density = (2 * |E|) / (|V| * (|V| - 1)) for undirected graphs.
 *
 * @param graph - The graph to validate
 * @param adjustments - Optional validation adjustments for constrained graphs
 * @returns PropertyValidationResult with validation details
 */
export declare const validateDensityAndCompleteness: (graph: TestGraph, adjustments?: Partial<Record<string, boolean>>) => PropertyValidationResult;
/**
 * Validates whether a graph is bipartite using BFS-based coloring.
 *
 * A graph is bipartite if its vertices can be divided into two disjoint sets
 * such that every edge connects a vertex in one set to a vertex in the other.
 * Equivalently, the graph contains no odd-length cycles.
 *
 * @param graph - The graph to validate
 * @returns PropertyValidationResult with validation details
 */
export declare const validateBipartite: (graph: TestGraph) => PropertyValidationResult;
/**
 * Validates tournament graph properties.
 *
 * A tournament is a complete directed graph where for every pair of vertices
 * (u, v), exactly one of (u, v) or (v, u) is an edge. Every tournament has
 * a Hamiltonian path.
 *
 * Properties checked:
 * 1. Completeness: For every pair of distinct vertices, exactly one directed edge exists
 * 2. No self-loops
 * 3. No parallel edges in opposite directions
 *
 * @param graph - The graph to validate
 * @returns PropertyValidationResult with validation details
 */
export declare const validateTournament: (graph: TestGraph) => PropertyValidationResult;
//# sourceMappingURL=structural.d.ts.map