import { GraphSpec } from '../spec';
import { TestEdge, TestNode, SeededRandom } from './types';
/**
 * Generate scale-free graph edges (Barabási-Albert preferential attachment).
 * Scale-free graphs have power-law degree distribution.
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateScaleFreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
/**
 * Generate small-world graph edges (Watts-Strogatz model).
 * Small-world graphs have high clustering + short paths.
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateSmallWorldEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
/**
 * Generate modular graph edges (community structure).
 * Modular graphs have dense communities + sparse inter-community edges.
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateModularEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
//# sourceMappingURL=network-structures.d.ts.map