Package com.evelopers.unimod.glayout.graph

Examples of com.evelopers.unimod.glayout.graph.SimpleEdge

88
89
90
91
92
93
94
95
96
         */
        ListIterator lie = sg.getEdges()
                             .listIterator();

        while (lie.hasNext()) {
            SimpleEdge edge = (SimpleEdge) lie.next();
            GraphHelper.checkAndReverse(edge, stn);
        }
    }
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
92
        res.add(e);

        SimpleVertex curr = e.getTarget();

        while (curr != f.getDest()) {
            SimpleEdge tmp = (SimpleEdge) curr.getEdgesRelativeOutgoing(f)
                                              .get(0);
            res.add(tmp);
            curr = tmp.getTarget();
        }

        return res;
    }
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
    private static Chain getTowardsPathUnOri(Face f, SimpleEdge e, SimpleVertex source,
                                             SimpleVertex target) {
        Chain res = new Chain(f.getGraph());
        res.addEdge(e);

        SimpleEdge curre = e;
        res.addVertex(source);

        SimpleVertex curr = e.getAnother(source);
        res.addVertex(curr);

        while (curr != target) {
            SimpleEdge tmp;

            if (curr.getEdgesRelative(f)
                        .get(0) == curre) {
                tmp = (SimpleEdge) curr.getEdgesRelative(f)
                                       .get(1);
            } else {
                tmp = (SimpleEdge) curr.getEdgesRelative(f)
                                       .get(0);
            }

            res.addEdge(tmp);
            curr = tmp.getAnother(curr);
            res.addVertex(curr);
            curre = tmp;
        }

        return res;
View Full Code Here
184
185
186
187
188
189
190
191
192
193
194
195
196
            ListIterator li2     = element.getEdgesRelative(f)
                                          .listIterator();
            int count = 0;

            while (li2.hasNext()) {
                SimpleEdge ed = (SimpleEdge) li2.next();

                if (ed.getSource() == element) {
                    count++;
                } else {
                    count--;
                }
            }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
113
114
    public static SimpleEdge getFirstVerticalEdge(SimpleVertex v, SimpleGraph sg) {
        ListIterator li = v.getEdgesRelative(sg)
                           .listIterator();

        while (li.hasNext()) {
            SimpleEdge edge = (SimpleEdge) li.next();

            if (edge.isVertical()) {
                return edge;
            }
        }

        return null;
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
        List edges      = new ArrayList();
        ListIterator li = sg.getEdges()
                            .listIterator();

        while (li.hasNext()) {
            SimpleEdge edge = (SimpleEdge) li.next();

            if ((vertical) && (edge.getSource()
                                       .getOrthX() == corner.getOrthX())
                    && (edge.isVertical())) {
                edges.add(edge);
            }

            if ((!vertical) && (edge.getSource()
                                        .getOrthY() == corner.getOrthY())
                    && (edge.isHorizontal())) {
                edges.add(edge);
            }
        }

        Collections.sort(edges,
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
      }
    }
    for (Object obj : graph.getChildEdges(parent)) {
      if (obj instanceof mxCell) {
        mxCell cell = (mxCell) obj;
        SimpleEdge se = new SimpleEdge(vertexes.get(cell.getSource()), vertexes.get(cell.getTarget()));
        se.setProperty("id", cell.getId());
        sg.addEdge(se);
      }
    }
    MultiLayerLayouter.layout(sg);
   
        mxCell someCell = ((mxCell)vertexes.keySet().toArray()[0]);
        double xscale = someCell.getGeometry().getWidth() / (vertexes.get(someCell).getVertexext().getWidth() - .5);
        double yscale = someCell.getGeometry().getHeight() / (vertexes.get(someCell).getVertexext().getHeight() - .5);
    for (Object obj : sg.getVertices()) {
      if (obj instanceof SimpleVertex) {
        SimpleVertex sv = (SimpleVertex) obj;
       
        for (mxCell vertex: vertexes.keySet()) {
          if (vertex.getId().equals(sv.getProperty("id"))) {
            VertexExt ve =  sv.getVertexext();
            mxGeometry vertexGeometry = vertex.getGeometry();
            super.setVertexLocation(vertex, ve.getLeftTop().getX()*xscale, ve.getLeftTop().getY()*yscale);
          }
        }
               
      }
    }
    for (Object obj : sg.getEdges()) {
      if (obj instanceof SimpleEdge) {
        SimpleEdge se = (SimpleEdge) obj;
        for (Object e : graph.getChildEdges(parent)) {
          if (e instanceof mxCell) {
            mxCell edge = (mxCell) e;
            if (edge.getId().equals(se.getProperty("id"))) {
              List<mxPoint> jgraphpoints = new ArrayList<mxPoint>();
              jgraphpoints.add(new mxPoint(edge.getSource().getGeometry().getCenterX(),
                  edge.getTarget().getGeometry().getCenterY()));
              super.setEdgePoints(edge, jgraphpoints);
              super.setOrthogonalEdge(edge, true);
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
        public EdgeComparator(boolean vertical) {
            this.vertical = vertical;
        }

        public int compare(Object o1, Object o2) {
            SimpleEdge e1 = (SimpleEdge) o1;
            SimpleEdge e2 = (SimpleEdge) o2;

            if (vertical) {
                // bottom first
                if (GeometricHelper.getTopVetrtex(e1)
                                       .getOrthY() < GeometricHelper.getTopVetrtex(e2)
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
//        SimpleEdge eres = null;
        ListIterator li = sg.getEdges()
                            .listIterator();

        while (li.hasNext()) {
            SimpleEdge edge = (SimpleEdge) li.next();

            if (fitsIndependently(corner,
                                      xpreferred,
                                      edge.getSource(),
                                      res)) {
                res = edge.getSource();
            }
        }

        return res;
    }
View Full Code Here
192
193
194
195
196
197
198
199
200
201
202
203
204
        IOrthItem res   = new BendPoint(x, y);
        ListIterator li = sg.getEdges()
                            .listIterator();

        while (li.hasNext()) {
            SimpleEdge edge = (SimpleEdge) li.next();
            fitsAbstractly(corner,
                           edge.getSource(),
                           res);
        }

        return res;
    }
View Full Code Here
TOP

Related Classes of com.evelopers.unimod.glayout.graph.SimpleEdge

  • com.evelopers.unimod.glayout.fast.AltMultiLayerBuilder
  • com.evelopers.unimod.glayout.fast.OneLayerLayouter
  • com.evelopers.unimod.glayout.fast.OneLayerLayouter$EdgeDistComparator
  • com.evelopers.unimod.glayout.fast.OneLayerLayouter$EdgeXComparator
  • com.evelopers.unimod.glayout.graph.topsort.TopSorter
  • com.evelopers.unimod.glayout.graph.utils.AssociatedDigraph
  • com.evelopers.unimod.glayout.graph.utils.Connectivity
  • com.evelopers.unimod.glayout.graph.utils.PathsAssociatedDigraph
  • com.evelopers.unimod.glayout.graph.utils.STNumbering
  • com.evelopers.unimod.glayout.helpers.CompactionHelper
    • Copyright © 2018 www.massapicom. 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.