import { Graph } from '../../../algorithms/graph/graph';
import { Path } from '../../../algorithms/types/algorithm-results';
import { Edge, Node } from '../../../algorithms/types/graph';
import { PlantedPathConfig } from './path-generator';
/**
 * Extended configuration for heterogeneous graphs.
 */
export interface HeterogeneousPathConfig<N extends Node, E extends Edge> extends PlantedPathConfig<N, E> {
    /** Path template specifying node types along path */
    pathTemplate: string[];
    /** Entity types in the graph */
    entityTypes: string[];
}
/**
 * Plant paths in heterogeneous graphs respecting entity type constraints.
 *
 * Ensures planted paths follow a type pattern (e.g., Work → Author → Work → Institution).
 *
 * @template N - Node type
 * @template E - Edge type
 * @param graph - Heterogeneous graph
 * @param pathTemplate - Template specifying node types along path
 * @param config - Planting configuration
 * @returns Graph with planted heterogeneous paths
 */
export declare const plantHeterogeneousPaths: <N extends Node, E extends Edge>(graph: Graph<N, E>, pathTemplate: string[], config: HeterogeneousPathConfig<N, E>) => import('./path-generator').PlantedPathResult<N, E>;
/**
 * Filter nodes by entity type.
 * @param nodes
 * @param entityType
 */
export declare const filterNodesByType: <N extends Node>(nodes: N[], entityType: string) => N[];
/**
 * Check if a path follows a type template.
 * @param path
 * @param template
 */
export declare const pathFollowsTemplate: <N extends Node, E extends Edge>(path: Path<N, E>, template: string[]) => boolean;
//# sourceMappingURL=heterogeneous-planting.d.ts.map