Examples of JGraphHierarchyEdge


Examples of com.jgraph.layout.hierarchical.model.JGraphHierarchyEdge

        } else {
          boundsWarning = true;
        }
        maxY = Math.max(maxY, cell.height);
      } else if (cell.isEdge()) {
        JGraphHierarchyEdge edge = (JGraphHierarchyEdge) cell;
        // The width is the number of additional parallel edges
        // time the parallel edge spacing
        int numEdges = 1;
        if (edge.edges != null) {
          numEdges = edge.edges.size();
View Full Code Here

Examples of com.jgraph.layout.hierarchical.model.JGraphHierarchyEdge

          } else {
            boundsWarning = true;
          }
          maxCellHeight = Math.max(maxCellHeight, cell.height);
        } else if (cell.isEdge()) {
          JGraphHierarchyEdge edge = (JGraphHierarchyEdge) cell;
          // The width is the number of additional parallel edges
          // time the parallel edge spacing
          int numEdges = 1;
          if (edge.edges != null) {
            numEdges = edge.edges.size();
View Full Code Here

Examples of com.jgraph.layout.hierarchical.model.JGraphHierarchyEdge

            // after positioning is complete.
            if (positionX + 1 < initialX) {
              contextTranslation = initialX - positionX;
            }
          } else if (cellType == 1 && cell.isEdge()) {
            JGraphHierarchyEdge edge = (JGraphHierarchyEdge) cell;
            // For parallel edges we need to seperate out the points
            // a
            // little
            Iterator parallelEdges = edge.edges.iterator();
            double offsetX = 0.0;
            // Only set the edge control points once
            if (edge.temp[0] != 101207) {
              while (parallelEdges.hasNext()) {
                Object realEdge = parallelEdges.next();
                List oldPoints = facade.getPoints(realEdge);
                List newPoints = new ArrayList(
                    (edge.x.length) + 2);
                newPoints.add(oldPoints.get(0));
                if (edge.isReversed()) {
                  // Reversed edges need the points inserted
                  // in
                  // reverse order
                  for (int j = 0; j < edge.x.length; j++) {
                    double positionX = edge.x[j] + offsetX
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.