import { type GraphInstance } from './graphology-compat.js';
/**
 * PageRank with an isolate-filter workaround.
 *
 * graphology-metrics' pagerank fails to converge when the graph contains
 * isolated nodes (degree === 0). We split them out, score them as 0, then
 * run PageRank on the connected subgraph and merge the results.
 *
 * Ported from the reference `safeRank` (graph.ts:12-38).
 */
export declare function pageRank(graph: GraphInstance): Record<string, number>;
/**
 * Top-`limit` nodes by betweenness centrality on the input graph. Callers
 * typically pass an undirected projection.
 */
export declare function betweennessCentralityTop(graph: GraphInstance, limit: number): Array<{
    id: string;
    title: string;
    score: number;
}>;
/**
 * Top-`limit` nodes by betweenness centrality, with raw scores normalized by
 * the max possible number of shortest paths in an undirected graph —
 * `n * (n - 1) / 2`. Raw betweenness scales with graph size, so unnormalized
 * scores from different vaults aren't comparable; this division yields a
 * value in [0, 1] that means the same thing regardless of `n`.
 *
 * Empty / singleton graphs return an empty list rather than dividing by zero.
 */
export declare function betweennessCentralityNormalized(graph: GraphInstance, limit: number): Array<{
    id: string;
    title: string;
    score: number;
}>;
export { betweennessCentralityTop as betweennessCentrality };