Package org.jungrapht.visualization.layout.algorithms

Class HierarchicalMinCrossLayoutAlgorithm<V,​E>

  • Type Parameters:
    V - vertex type
    E - edge type
    All Implemented Interfaces:
    Consumer<Function<V,​Rectangle>>, Layered<V,​E>, LayoutAlgorithm<V>, AfterRunnable, EdgeArticulationFunctionSupplier<E>, ExecutorConsumer, Threaded, VertexBoundsFunctionConsumer<V>
    public class HierarchicalMinCrossLayoutAlgorithm<V,​E>
extends AbstractHierarchicalMinCrossLayoutAlgorithm<V,​E>
implements LayoutAlgorithm<V>, VertexBoundsFunctionConsumer<V>, Layered<V,​E>, AfterRunnable, ExecutorConsumer, Threaded
    A Hierarchical Minimum-Cross layout algorithm based on Sugiyama. Uses the Eiglsperger optimations for large graphs. A threshold property may be used to control the decision to switch from the standard Sugiyama algorithm to the faster Eiglsperger algorithm.
    See Also:
    "Methods for Visual Understanding Hierarchical System Structures. KOZO SUGIYAMA, MEMBER, IEEE, SHOJIRO TAGAWA, AND MITSUHIKO TODA, MEMBER, IEEE", "An E log E Line Crossing Algorithm for Levelled Graphs. Vance Waddle and Ashok Malhotra IBM Thomas J. Watson Research Center", "Simple and Efficient Bilayer Cross Counting. Wilhelm Barth, Petra Mutzel, Institut für Computergraphik und Algorithmen Technische Universität Wien, Michael Jünger, Institut für Informatik Universität zu Köln", "Fast and Simple Horizontal Coordinate Assignment, Ulrik Brandes and Boris Köpf, Department of Computer & Information Science, University of Konstanz", "An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. Markus Eiglsperger, Martin Siebenhaller, Michael Kaufman"