import { ReadableGraph } from '../../interfaces/readable-graph';
import { Edge, Node } from '../types/graph';
import { Graph } from './graph';
/**
 * Adapts the algorithms Graph class to the ReadableGraph interface.
 *
 * @template N - Node type extending Node
 * @template E - Edge type extending Edge
 * @example
 * ```typescript
 * const graph = new Graph<MyNode, MyEdge>(true);
 * graph.addNode({ id: 'A', type: 'test' });
 * graph.addNode({ id: 'B', type: 'test' });
 * graph.addEdge({ id: 'E1', source: 'A', target: 'B', type: 'edge' });
 *
 * const adapter = new GraphAdapter(graph);
 * const result = bfs(adapter, 'A');
 * ```
 */
export declare class GraphAdapter<N extends Node, E extends Edge> implements ReadableGraph<N, E> {
    private readonly graph;
    constructor(graph: Graph<N, E>);
    hasNode(id: string): boolean;
    getNode(id: string): N | null;
    getNeighbors(id: string): string[];
    getAllNodes(): N[];
    isDirected(): boolean;
    getOutgoingEdges(id: string): E[];
}
//# sourceMappingURL=graph-adapter.d.ts.map