Package com.evelopers.unimod.glayout.graph

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

399
400
401
402
403
404
405
406
407
408
409
410
411
    private SimpleEdge getAnotherEdge(SimpleVertex sv, SimpleEdge se) {
        ListIterator li = sv.getEdgesRelative(f)
                            .listIterator();

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

            if (!e.equals(se)) {
                return e;
            }
        }

        return null;
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
    protected void orientOnChain(GContainer ac, SimpleVertex source, SimpleVertex target,
                                 Object tocheck, Object key) {
        SimpleVertex curr = source;

        // another edge
        SimpleEdge curre = null;

        while (curr != target) {
            // curr is changing
            List edges      = curr.getEdgesRelative(ac);
            ListIterator li = edges.listIterator();

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

                if (element != curre) {
                    if ((tocheck == null) || (element.getProperty(tocheck) == null)) {
                        if (element.getTarget() == curr) {
                            element.reverse();
                        }
                    }

                    if (tocheck != null) {
                        element.setProperty(tocheck, key);
                    }

                    curr      = element.getAnother(curr);
                    curre     = element;

                    break;
                }
            }
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
        ListIterator li2 = sg.getEdges()
                             .listIterator();

        while (li2.hasNext()) {
            SimpleEdge element = (SimpleEdge) li2.next();
            element.setVisX(asd.getCorrespondingVertex(element.getLeft()).getTopnum());
            element.setVisYB(element.getOrig().getTopnum());
            element.setVisYT(element.getDest().getTopnum());
        }
    }
View Full Code Here
121
122
123
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
    private void convertBendpoints() {
        SimpleEdge[] edges = (SimpleEdge[]) sg.getEdges()
                                              .toArray(new SimpleEdge[0]);

        for (int i = 0; i < edges.length; i++) {
            SimpleEdge edge = edges[i];

            // will update faces
            GraphsContainer vgc =
                new GraphsContainer(sg,
                                    edge.getLeft(),
                                    edge.getRight());
            BendPoint[] bps =
                (BendPoint[]) edge.getBendPoints()
                                  .toArray(new BendPoint[0]);
            SimpleVertex currsource = edge.getSource();

            for (int j = 0; j < bps.length; j++) {
                SimpleVertex v = new SimpleVertex();
                v.setProperty(FICTIVE_KEY, edge);

                // to set the bendpoints order
                v.setProperty(FICTIVENUMBER_KEY,
                              new Integer(j));
                v.setOrthX(bps[j].getOrthX());
                v.setOrthY(bps[j].getOrthY());
                vgc.addVertex(v);

                SimpleEdge e = new SimpleEdge(currsource, v);
                e.setProperty(FICTIVE_KEY, FICTIVE_VALUE);

                /* thre is really no need to set left and right properties
                 * 'cause the HashMap link is to edge, and
                 * we are going to work only with it.
                 */
                vgc.addEdge(e);
                currsource = v;
            }

            if (bps.length > 0) {
                SimpleEdge e = new SimpleEdge(currsource,
                                              edge.getTarget());
                e.setProperty(FICTIVE_KEY, FICTIVE_VALUE);
                vgc.addEdge(e);
                vgc.removeEdge(edge);
            }
        }
    }
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
        IOrthItem corner = GeometricHelper.getAbstractCorner(sg, c);
        List edges       =
            CompactionHelper.getInstance()
                            .getEdgesSorted(sg, vertical, corner);
        ListIterator li = edges.listIterator();
        SimpleEdge prev = (SimpleEdge) li.next();

        while (li.hasNext()) {
            SimpleEdge next = (SimpleEdge) li.next();
            boolean add     = false;
            SimpleVertex v1 = null;
            SimpleVertex v2 = null;

            if (vertical) {
                if (GeometricHelper.getBottomVetrtex(prev)
                                       .getOrthY() < GeometricHelper.getTopVetrtex(next)
                                                                        .getOrthY()) {
                    v1      = GeometricHelper.getBottomVetrtex(prev);
                    v2      = GeometricHelper.getTopVetrtex(next);
                    add     = true;
                }
            } else {
                if (GeometricHelper.getRightVetrtex(prev)
                                       .getOrthX() < GeometricHelper.getLeftVetrtex(next)
                                                                        .getOrthX()) {
                    v1      = GeometricHelper.getRightVetrtex(prev);
                    v2      = GeometricHelper.getLeftVetrtex(next);
                    add     = true;
                }
            }

            if (add) {
                SimpleEdge e = new SimpleEdge(v1, v2);
                e.setProperty(FICTIVE_KEY, FICTIVE_VALUE);

                GraphsContainer vgc = proceedBridge(prev.getAnother(v1),
                                                    v1,
                                                    v2);
                vgc.addEdge(e);
View Full Code Here
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
            SimpleVertex v        = new SimpleVertex();
            v.setProperty(CORNER_KEY, FICTIVE_VALUE);
            v.setOrthX(acorner.getOrthX());
            v.setOrthY(acorner.getOrthY());

            SimpleEdge e1 = new SimpleEdge(rcorner1, v);
            e1.setProperty(FICTIVE_KEY, FICTIVE_VALUE);

            SimpleEdge e2 = new SimpleEdge(v, rcorner2);
            e2.setProperty(FICTIVE_KEY, FICTIVE_VALUE);

            SimpleVertex tvertex =
                CompactionHelper.getFirstVerticalEdge(rcorner1, sg)
                                .getAnother(rcorner1);
View Full Code Here
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
            (SimpleVertex[]) sg.getVertices()
                               .toArray(new SimpleVertex[0]);

        for (int i = 0; i < vertices.length; i++) {
            if (vertices[i].getProperty(FICTIVE_KEY) != null) {
                SimpleEdge edge     = vertices[i].getEdgeProperty(FICTIVE_KEY);
                GraphsContainer vgc =
                    new GraphsContainer(sg,
                                        edge.getLeft(),
                                        edge.getRight());
                int number   = vertices[i].getIntProperty(FICTIVENUMBER_KEY);
                BendPoint bp = (BendPoint) edge.getBendPoints()
                                               .get(number);
                vgc.removeVertex(vertices[i]);

                // duplicating is controlled inside
                vgc.addEdge(edge);
View Full Code Here
389
390
391
392
393
394
395
396
397
398
399
            (SimpleVertex[]) sg.getVertices()
                               .toArray(new SimpleVertex[0]);

        for (int i = 0; i < vertices.length; i++) {
            if (vertices[i].getProperty(FaceRectangulator.FICTIVEFACE_KEY) != null) {
                SimpleEdge e =
                    vertices[i].getEdgeProperty(FaceRectangulator.FICTIVEFACE_KEY);

                // sg controls repeating itself
                sg.addEdge(e);
                sg.removeVertex(vertices[i]);
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
        li = tempg.getEdges()
                  .listIterator();

        // adding other vertices, which lay in G'
        while (li.hasNext()) {
            SimpleEdge element = (SimpleEdge) li.next();

            if (((element.getSource()
                             .getProperty(this) != null)
                    && (element.getTarget()
                                   .getProperty(this) == null))
                    || ((element.getTarget()
                                    .getProperty(this) != null)
                    && (element.getSource()
                                   .getProperty(this) == null))
                    || ((element.getSource()
                                    .getProperty(this) == element.getTarget()
                                                                     .getProperty(this))
                    && (element.getSource()
                                   .getProperty(this) != null))) {
                Integer ii =
                    (Integer) ((element.getSource()
                                       .getProperty(this) == null)
                               ? element.getTarget()
                                        .getProperty(this)
                               : element.getSource()
                                        .getProperty(this));

                if (element.getSource()
                               .getProperty(this) == null) {
                    ((Segment) currSegments.get(ii.intValue())).addVertex(element
                                                                          .getSource());
                }

                if (element.getTarget()
                               .getProperty(this) == null) {
                    ((Segment) currSegments.get(ii.intValue())).addVertex(element
                                                                          .getTarget());
                }

                ((Segment) currSegments.get(ii.intValue())).addEdge(element);
            }
        }

        sg.removePropertyAsc(this);

        // one edge property
        li = tempg.getEdges()
                  .listIterator();

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

            if ((planarg.getVertices()
                            .indexOf(element.getSource()) != -1)
                    && (planarg.getVertices()
                                   .indexOf(element.getTarget()) != -1)
                    && (planarg.getEdges()
                                   .indexOf(element) == -1)) {
                Segment s = new Segment(planarg);
                s.addEdge(element);
                s.addVertex(element.getSource());
                s.addVertex(element.getTarget());
                currSegments.add(s);
            }
        }
    }
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
                               .listIterator();

        List todel = new ArrayList();

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

            if (!gv.contains(element.getTarget()) && gv.contains(element.getSource())) {
                makeDE(todel, element);
            } else if (gv.contains(element.getTarget())
                           && !gv.contains(element.getSource())) {
                makeDE(todel, element);
            } else if (!gv.contains(element.getTarget())
                           && !gv.contains(element.getSource())) {
                makeDE(todel, element);
            } else {
                continue;
            }
        }
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.