Class StandardFA2Repulsion<V,​R extends StandardFA2Repulsion<V,​R,​B>,​B extends StandardFA2Repulsion.Builder<V,​R,​B>>

  • Type Parameters:
    V - vertex class
    R - repulsion class
    B - repulsion builder class
    All Implemented Interfaces:
    StandardRepulsion<V,​R,​B>
    Direct Known Subclasses:
    BarnesHutFA2Repulsion

    public class StandardFA2Repulsion<V,​R extends StandardFA2Repulsion<V,​R,​B>,​B extends StandardFA2Repulsion.Builder<V,​R,​B>>
    extends Object
    implements StandardRepulsion<V,​R,​B>
    Standard implementation of repulsion. We can strongly recommend to use this class only for Graphs with hundreds nodes. Complexity is O(N^2).

    For large Graphs use BarnesHutFA2Repulsion.

    See Also:
    "ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software", "https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0098679"