import { Graph } from '../../algorithms/graph/graph';
import { RankedPath } from '../../algorithms/pathfinding/path-ranking';
import { Edge, Node } from '../../algorithms/types/graph';
import { Option } from '../../algorithms/types/option';
import { Result } from '../../algorithms/types/result';
/**
 * Configuration for random path ranking.
 */
export interface RandomPathConfig {
    /**
     * Traversal mode for path finding.
     */
    traversalMode?: "directed" | "undirected";
    /**
     * Maximum number of paths to return.
     */
    maxPaths?: number;
    /**
     * Random seed for reproducibility.
     */
    seed?: number;
}
/**
 * Rank paths between two nodes randomly.
 *
 * This baseline serves as a statistical control. All paths receive
 * the same score (1.0), but their order is randomised. This helps
 * establish whether Path Salience Ranking provides meaningful improvements.
 *
 * @template N - Node type
 * @template E - Edge type
 * @param graph - The graph to search
 * @param startId - Source node ID
 * @param endId - Target node ID
 * @param config - Optional configuration including seed for reproducibility
 * @returns Result containing randomly-ranked paths or error
 */
export declare const randomPathRanking: <N extends Node, E extends Edge>(graph: Graph<N, E>, startId: string, endId: string, config?: RandomPathConfig) => Result<Option<RankedPath<N, E>[]>, {
    type: string;
    message: string;
}>;
//# sourceMappingURL=random-path-ranking.d.ts.map