import { Cliquewidth, Pathwidth } from '../generation/spec/width.js';
import { AnalyzerGraph, ComputePolicy } from './types.js';
/**
 * Compute Pathwidth property from graph structure.
 * Pathwidth is a graph width measure: the minimum width over all path decompositions.
 *
 * Uses heuristics:
 * - Trees have pathwidth 1
 * - Outerplanar graphs have pathwidth at most 2
 * - For general graphs: Use greedy elimination heuristic
 *
 * @param g - Analyzer graph
 * @param _policy - Computation policy (unused)
 * @returns Pathwidth property: "pathwidth_bounded" or "unconstrained"
 */
export declare const computePathwidth: (g: AnalyzerGraph, _policy?: ComputePolicy) => Pathwidth;
/**
 * Compute Cliquewidth property from graph structure.
 * Cliquewidth is a graph width measure: the minimum number of labels needed
 * in a clique-width expression.
 *
 * Uses graph class detection:
 * - Cographs (P4-free): clique-width ≤ 2
 * - Trees: clique-width ≤ 3
 * - Distance-hereditary: clique-width ≤ 3
 * - Bipartite: clique-width ≤ 4
 *
 * @param g - Analyzer graph
 * @param _policy - Computation policy (unused)
 * @returns Cliquewidth property: "cliquewidth_bounded" or "unconstrained"
 */
export declare const computeCliquewidth: (g: AnalyzerGraph, _policy?: ComputePolicy) => Cliquewidth;
//# sourceMappingURL=width.d.ts.map