/**
 * Spring layout algorithm (Fruchterman-Reingold variant)
 */

import { Graph, Node, PositionMap } from "../../types";
import { fruchtermanReingoldLayout } from "./fruchterman-reingold";

/**
 * Position nodes using Fruchterman-Reingold force-directed algorithm.
 * @param G - Graph or list of nodes
 * @param k - Optimal distance between nodes
 * @param pos - Initial positions for nodes
 * @param fixed - Nodes to keep fixed at initial position
 * @param iterations - Maximum number of iterations
 * @param scale - Scale factor for positions
 * @param center - Coordinate pair around which to center the layout
 * @param dim - Dimension of layout
 * @param seed - Random seed for initial positions
 * @returns Positions dictionary keyed by node
 */
export function springLayout(
    G: Graph,
    k: number | null = null,
    pos: PositionMap | null = null,
    fixed: Node[] | null = null,
    iterations: number = 50,
    scale: number = 1,
    center: number[] | null = null,
    dim: number = 2,
    seed: number | null = null,
): PositionMap {
    // Legacy compatibility alias
    return fruchtermanReingoldLayout(G, k, pos, fixed, iterations, scale, center, dim, seed);
}