/**
 * F2: Community detection — Label Propagation and Modularity
 *
 * Uses iterative SQL with temp tables (no recursive CTEs — segfault risk).
 * Validated patterns from tests/fierce-f2f5.ts.
 */
import type { CommunityDetectResult, ModularityResult } from '../types/graph-types.js';
import { type ComputeSession, type DuckDBLike } from '../compute-session.js';
/**
 * graph.community_detect — Label propagation
 * Each node adopts the most common label among its neighbors.
 */
export declare function handleCommunityDetect(args: unknown, duckdb: DuckDBLike | ComputeSession): Promise<CommunityDetectResult>;
/**
 * graph.modularity — Compute modularity score Q
 * Q = (1/2m) * SUM[(A_ij - k_i*k_j/2m) * delta(c_i, c_j)]
 * If no community_column is given, runs community_detect first.
 */
export declare function handleModularity(args: unknown, duckdb: DuckDBLike | ComputeSession): Promise<ModularityResult>;
//# sourceMappingURL=graph-community.d.ts.map