import { Graph } from '../../../../../algorithms/graph/graph'; import { Neighbor } from '../../../../../interfaces/graph-expander'; export interface TestNode { id: string; type: string; [key: string]: unknown; } export interface TestEdge { id: string; source: string; target: string; type: string; [key: string]: unknown; } /** * Adapter to use Graph class with expansion algorithms */ export declare class GraphExpanderAdapter { private readonly graph; private adjacency; private degrees; private nodes; constructor(graph: Graph, directed?: boolean); getNeighbors(nodeId: string): Promise; getDegree(nodeId: string): number; getNode(nodeId: string): Promise; addEdge(): void; calculatePriority(nodeId: string, options?: { nodeWeight?: number; epsilon?: number; }): number; getAllDegrees(): Map; } /** * Create a test graph from edge list * @param edges */ export declare const createGraph: (edges: Array<[string, string]>) => Graph; /** * Create a chain graph (linear path) * @param length */ export declare const createChainGraph: (length: number) => Graph; /** * Create a grid graph (rows x cols) * @param rows * @param cols */ export declare const createGridGraph: (rows: number, cols: number) => Graph; /** * Create a hub graph with central hub nodes and leaf nodes * @param numberHubs * @param leavesPerHub */ export declare const createHubGraph: (numberHubs: number, leavesPerHub: number) => Graph; //# sourceMappingURL=representativeness-helpers.d.ts.map