/**
 * Graph Utility Service
 * Contains helper methods and utility functions for knowledge graph operations
 */
import { KnowledgeNode, KnowledgeTriad, NodeType, RelationType } from '../types';
export interface IGraphUtilityService {
    generateNodeId(type: NodeType, name: string, namespace?: string): string;
    generateTriadId(subject: string, predicate: RelationType, object: string): string;
    hasConnection(nodeId1: string, nodeId2: string, triads: Map<string, KnowledgeTriad>): boolean;
    calculateClusterCoherence(nodes: string[], triads: Map<string, KnowledgeTriad>): number;
    calculateClusteringCoefficient(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): number;
    groupDuplicates(duplicateTriads: KnowledgeTriad[]): string[][];
    dfsComponent(startNode: string, nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>, visited: Set<string>): Promise<string[]>;
}
export declare class GraphUtilityService implements IGraphUtilityService {
    private logger;
    generateNodeId(type: NodeType, name: string, namespace?: string): string;
    generateTriadId(subject: string, predicate: RelationType, object: string): string;
    hasConnection(nodeId1: string, nodeId2: string, triads: Map<string, KnowledgeTriad>): boolean;
    calculateClusterCoherence(nodes: string[], triads: Map<string, KnowledgeTriad>): number;
    groupDuplicates(duplicateTriads: KnowledgeTriad[]): string[][];
    dfsComponent(startNode: string, nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>, visited: Set<string>): Promise<string[]>;
    /**
     * Calculate clustering coefficient for the graph
     */
    calculateClusteringCoefficient(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): number;
    /**
     * Check if a node is semantically similar to another
     */
    isSemanticallySimilar(nodeId1: string, nodeId2: string, triads: Map<string, KnowledgeTriad>, threshold?: number): boolean;
    /**
     * Find all nodes that are semantically related to a given node
     */
    findSemanticNeighbors(nodeId: string, triads: Map<string, KnowledgeTriad>, semanticRelations?: RelationType[]): string[];
    /**
     * Calculate semantic density of a subgraph
     */
    calculateSemanticDensity(nodeIds: string[], triads: Map<string, KnowledgeTriad>): number;
    private simpleHash;
}
//# sourceMappingURL=graph-utility-service.d.ts.map