/**
 * F3: Weighted path algorithms — strongest, cheapest, combined
 *
 * Uses iterative SQL with temp tables (no recursive CTEs — segfault risk).
 * Validated patterns from tests/fierce-f3f5.ts.
 */
import type { WeightedPathResult } from '../types/graph-types.js';
import { type ComputeSession, type DuckDBLike } from '../compute-session.js';
/**
 * graph.weighted_path — Find paths using one of three modes:
 * - strongest: BFS maximizing multiplicative weight
 * - cheapest: Bellman-Ford minimizing cost (1 - weight)
 * - combined: BFS with additive weight accumulation
 */
export declare function handleWeightedPath(args: unknown, duckdb: DuckDBLike | ComputeSession): Promise<WeightedPathResult>;
//# sourceMappingURL=graph-paths.d.ts.map