import { EdgeBase, NodeBase, ReadableGraph } from '../../interfaces/readable-graph';
export interface TraversalResult<N> {
    /** Nodes in visitation order (level-by-level for BFS) */
    visitOrder: N[];
    /** Parent mapping for path reconstruction (child → parent) */
    parents: Map<string, string | null>;
}
export interface InvalidInputError {
    type: "invalid-input";
    message: string;
}
export interface Ok<T> {
    ok: true;
    value: T;
}
export interface Error_<E> {
    ok: false;
    error: E;
}
export type Result<T, E> = Ok<T> | Error_<E>;
/**
 * Breadth-First Search traversal.
 * @param graph
 * @param startId
 */
export declare const bfs: <N extends NodeBase, E extends EdgeBase>(graph: ReadableGraph<N, E>, startId: string) => Result<TraversalResult<N>, InvalidInputError>;
//# sourceMappingURL=bfs.d.ts.map