Steven24K

/**
 * Force directed graph layout algorithm according to Fruchterman and Reingold's principle. 
 * The algorithm can be summarized as follows: 
 * algorithm SPRING(G:graph);
 * place vertices of G in random locations;
 * repeat N times
 *     calculate the force on each vertex;
 *     move the vertex c4
 * draw graph on canvas, plotter or any drawing tool.
 * 

Steven24K

export interface Func<a, b> {
    f: (_: a) => b
    then: <c>(this: Func<a, b>, g: Func<b, c>) => Func<a, c>
    repeat: (this: Func<a, a>) => Func<number, Func<a, a>>
    repeatUntil: (this: Func<a, a>) => Func<Func<a, boolean>, Func<a, a>>
}

export let Func = <a, b>(f: (_: a) => b): Func<a, b> => {
    return {
        f: f,