Package diva.graph.layout
Class LayoutUtilities
- java.lang.Object
-
- diva.graph.layout.LayoutUtilities
-
public final class LayoutUtilities extends java.lang.Object
Miscellaneous utility routines used in layout.- Version:
- $Id$
- Author:
- Michael Shilman
- Pt.AcceptedRating:
- Red
-
-
Constructor Summary
Constructors Constructor Description LayoutUtilities()
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static boolean
checkConsistency(java.lang.Object composite, GraphModel model)
Check consistency of the graph in terms of topology and layout.static boolean
checkContainment(java.lang.Object composite, GraphModel model)
Check consistency and containment in terms of topology and layout.static void
place(LayoutTarget target, java.lang.Object node, double x, double y)
Place the given node at the given position and reroute its edges.static void
placeNoReroute(LayoutTarget target, java.lang.Object node, double x, double y)
Place the given node at the given position but do not reroute its edges.static void
routeVisibleEdges(java.lang.Object composite, LayoutTarget target)
Iterate over all the visible edges in the given graph and reroute them.
-
-
-
Method Detail
-
place
public static final void place(LayoutTarget target, java.lang.Object node, double x, double y)
Place the given node at the given position and reroute its edges.
-
placeNoReroute
public static final void placeNoReroute(LayoutTarget target, java.lang.Object node, double x, double y)
Place the given node at the given position but do not reroute its edges.
-
checkConsistency
public static final boolean checkConsistency(java.lang.Object composite, GraphModel model)
Check consistency of the graph in terms of topology and layout.
-
checkContainment
public static final boolean checkContainment(java.lang.Object composite, GraphModel model)
Check consistency and containment in terms of topology and layout.
-
routeVisibleEdges
public static final void routeVisibleEdges(java.lang.Object composite, LayoutTarget target)
Iterate over all the visible edges in the given graph and reroute them.
-
-