Package com.evelopers.unimod.glayout.graph

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

196
197
198
199
200
201
202
203
204
205
206
207
208
        ListIterator li = sg.getVertices()
                            .listIterator();
        int i = 0;

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

            if (element.getProperty(o) == null) {
                dfsFill(sg,
                        element,
                        o,
                        new Integer(i),
                        hv);
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
                  .size();
        int i             = 1;
        SimpleEdge anEdge;

        while (true) {
            SimpleVertex sv = (SimpleVertex) ll.removeLast();

            if (sv == dst) {
                sv.setProperty(STNUM_KEY,
                               new Integer(n));
                nodesInStOrder.addLast(sv);

                break;
            }

            Path p = pathFind(sv);

            if (p.getEdges()
                     .size() == 0) {
                sv.setProperty(STNUM_KEY,
                               new Integer(i));
                nodesInStOrder.addLast(sv);
                i++;
            } else {
                ListIterator lie = p.getEdges()
View Full Code Here
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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
        Path path            = new Path(sg);
        List lEdges;
        List lEdges2;
        SimpleEdge anEdge;
        SimpleEdge tempEdge;
        SimpleVertex aVertex;

        // case 1
        lEdges = sv.getEdgesRelative(sg);

        ListIterator lie = lEdges.listIterator();

        while (lie.hasNext()) {
            anEdge = (SimpleEdge) lie.next();

            if (!anEdge.getBooleanProperty(ISOLD_KEY)
                    && anEdge.getBooleanProperty(ISBACKEDGE_KEY)
                    && ((anEdge.getAnother(sv)).getIntProperty(DFSNUM_KEY) < sv
                                                                                 .getIntProperty(DFSNUM_KEY))) {
                anEdge.setProperty(ISOLD_KEY, Boolean.TRUE);
                path.addEdge(anEdge);

                return path;
            }
        }

        // case 2
        lEdges     = sv.getEdgesRelative(sg);
        lie        = lEdges.listIterator();

        while (lie.hasNext()) {
            anEdge = (SimpleEdge) lie.next();

            if (!anEdge.getBooleanProperty(ISOLD_KEY)
                    && !anEdge.getBooleanProperty(ISBACKEDGE_KEY)
                    && (anEdge.getAnother(sv)
                                  .getVertexProperty(PARENT_KEY) == sv)
                    && (anEdge.getAnother(sv)
                                  .getIntProperty(DFSNUM_KEY) > sv.getIntProperty(DFSNUM_KEY))) {
                anEdge.setProperty(ISOLD_KEY, Boolean.TRUE);
                path.addEdge(anEdge);
                aVertex = anEdge.getAnother(sv);

                boolean found;

                while (!aVertex.getBooleanProperty(ISOLD_KEY)) {
                    lEdges2     = aVertex.getEdgesRelative(sg);
                    found       = false;

                    ListIterator lie2 = lEdges2.listIterator();

                    while (lie2.hasNext()) {
                        tempEdge = (SimpleEdge) lie2.next();

                        if (!tempEdge.getBooleanProperty(ISOLD_KEY)
                                && ((tempEdge.getAnother(aVertex)).getIntProperty(DFSNUM_KEY) == aVertex
                                                                                                     .getIntProperty(LOWNUM_KEY))) {
                            aVertex.setProperty(ISOLD_KEY, Boolean.TRUE);
                            tempEdge.setProperty(ISOLD_KEY, Boolean.TRUE);
                            path.addEdge(tempEdge);
                            found = true;

                            break;
                        }
                    }

                    if (!found) {
                        lEdges2     = aVertex.getEdgesRelative(sg);
                        lie2        = lEdges2.listIterator();

                        while (lie2.hasNext()) {
                            tempEdge = (SimpleEdge) lie2.next();

                            if (!tempEdge.getBooleanProperty(ISOLD_KEY)
                                    && (tempEdge.getAnother(aVertex)
                                                    .getVertexProperty(PARENT_KEY) == aVertex)
                                    && (tempEdge.getAnother(aVertex)
                                                    .getIntProperty(LOWNUM_KEY) == aVertex
                                                                                       .getIntProperty(LOWNUM_KEY))) {
                                aVertex.setProperty(ISOLD_KEY, Boolean.TRUE);
                                tempEdge.setProperty(ISOLD_KEY, Boolean.TRUE);
                                path.addEdge(tempEdge);
                                aVertex = tempEdge.getAnother(aVertex);

                                break;
                            }
                        }
                    }
                }

                return path;
            }
        }

        // case 3
        lEdges     = sv.getEdgesRelative(sg);
        lie        = lEdges.listIterator();

        while (lie.hasNext()) {
            anEdge = (SimpleEdge) lie.next();

            if (!anEdge.getBooleanProperty(ISOLD_KEY)
                    && anEdge.getBooleanProperty(ISBACKEDGE_KEY)
                    && (anEdge.getAnother(sv)
                                  .getIntProperty(DFSNUM_KEY) > sv.getIntProperty(DFSNUM_KEY))) {
                anEdge.setProperty(ISOLD_KEY, Boolean.TRUE);
                path.addEdge(anEdge);
                aVertex = anEdge.getAnother(sv);

                while (!aVertex.getBooleanProperty(ISOLD_KEY)) {
                    lEdges2 = aVertex.getEdgesRelative(sg);

                    ListIterator lie2 = lEdges2.listIterator();

                    while (lie2.hasNext()) {
                        tempEdge = (SimpleEdge) lie2.next();

                        if (!tempEdge.getBooleanProperty(ISOLD_KEY)
                                && ((tempEdge.getAnother(aVertex)) == aVertex
                                                                          .getVertexProperty(PARENT_KEY))) {
                            aVertex.setProperty(ISOLD_KEY, Boolean.TRUE);
                            tempEdge.setProperty(ISOLD_KEY, Boolean.TRUE);
                            path.addEdge(tempEdge);
                            aVertex = tempEdge.getAnother(aVertex);

                            break;
View Full Code Here
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
        int i                  = 0;
        boolean flag;
        boolean hasUnusedEdges;
        boolean alreadyVisited = false;

        SimpleVertex temp = dst;
        Associatable.putLProperty(sg.getEdges(),
                                  ISUSED_KEY,
                                  Boolean.FALSE);
        Associatable.putLProperty(sg.getEdges(),
                                  ISBACKEDGE_KEY,
                                  Boolean.FALSE);
        Associatable.putLProperty(sg.getVertices(),
                                  DFSNUM_KEY,
                                  new Integer(0));
        Associatable.putLProperty(sg.getVertices(),
                                  LOWNUM_KEY,
                                  new Integer(0));

        do {
            if (!alreadyVisited) {
                i++;
                temp.setProperty(DFSNUM_KEY,
                                 new Integer(i));
                temp.setProperty(LOWNUM_KEY,
                                 new Integer(i));
            }

            if (temp == dst) {
                incv = new ArrayList();
                incv.addAll(temp.getEdgesRelative(sg));
                incv.remove(te);
                incv.add(0, te);
            } else {
                incv = temp.getEdgesRelative(sg);
            }

            flag               = false;
            hasUnusedEdges     = false;
            alreadyVisited     = false;

            ListIterator li    = incv.listIterator();

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

                if (!tempEdge.getBooleanProperty(ISUSED_KEY)) {
                    tempEdge.setProperty(ISUSED_KEY, Boolean.TRUE);
                    hasUnusedEdges = true;

                    SimpleVertex otherVertex = tempEdge.getAnother(temp);

                    // null instead of zero
                    if (otherVertex.getIntProperty(DFSNUM_KEY) == 0) {
                        tempEdge.setProperty(ISBACKEDGE_KEY, Boolean.FALSE);
                        otherVertex.setProperty(PARENT_KEY, temp);
                        temp = otherVertex;
                    } else {
                        tempEdge.setProperty(ISBACKEDGE_KEY, Boolean.TRUE);
                        temp.setProperty(LOWNUM_KEY,
                                         new Integer(Math.min(
                                                              temp.getIntProperty(LOWNUM_KEY),
                                                              otherVertex.getIntProperty(DFSNUM_KEY))));
                        alreadyVisited = true;
                    }

                    break;
                }
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
        topSort(ll, sourcenum);

        ListIterator li = ll.listIterator();

        while (li.hasNext()) {
            SimpleVertex element = (SimpleVertex) li.next();
            ListIterator li2     = element.getEdgesOutgoing()
                                          .listIterator();

            while (li2.hasNext()) {
                SimpleEdge edge = (SimpleEdge) li2.next();
                double delta    =
                    (0.0 + edge.getAnother(element)
                               .getTopnum()) - edge.getWeight() - element.getTopnum();

                if (delta < 0) {
                    int step = (int) Math.floor(-delta);
                    updateList(ll,
                               step,
View Full Code Here
110
111
112
113
114
115
116
117
118
     */
    private void updateList(LinkedList ll, int step, int start) {
        ListIterator li = ll.listIterator(start);

        while (li.hasNext()) {
            SimpleVertex element = (SimpleVertex) li.next();
            element.setTopnum(element.getTopnum() + step);
        }
    }
View Full Code Here
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
    private void topSort(LinkedList ll, double sourcenum) {
        ListIterator li = sg.getVertices()
                            .listIterator();

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

            if (element.getProperty(this) == null) {
                dfsvisit(element, ll);
            }
        }

        ListIterator topli = ll.listIterator();
        double startnum    = sourcenum;

        while (topli.hasNext()) {
            SimpleVertex element = (SimpleVertex) topli.next();
            element.setTopnum(startnum);
            startnum += 1.0;
        }

        sg.removePropertyAsc(this);
    }
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
        ListIterator li = sg.getVertices()
                            .listIterator();

        while (li.hasNext()) {
            SimpleVertex v = (SimpleVertex) li.next();

            if (BigVertex.isBig(v)) {
                bg.setColor(Consts.BIGVERTEX_C);
            } else {
                bg.setColor(Consts.VERTEX_C);
            }

            bg.fillOval(xconvert(v.getOrthX()) - (Consts.OVR / 2),
                        yconvert(v.getOrthY()) - (Consts.OVR / 2), Consts.OVR, Consts.OVR);
            bg.drawString("v" + v.getId(), xconvert(v.getOrthX()) + (Consts.VR / 2),
                          yconvert(v.getOrthY()) - (Consts.VR / 2));
        }

        li = sg.getEdges()
               .listIterator();
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
        double maxy     = Double.MIN_VALUE;
        ListIterator li = sg.getVertices()
                            .listIterator();

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

            if (element.getOrthY() > maxy) {
                maxy = element.getOrthY();
            }

            if (element.getOrthX() > maxx) {
                maxx = element.getOrthX();
            }
        }

        ListIterator lie = sg.getEdges()
                             .listIterator();
View Full Code Here
TOP

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

  • 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.containers.Face
  • com.evelopers.unimod.glayout.graph.containers.Path
  • com.evelopers.unimod.glayout.graph.containers.Segment
  • com.evelopers.unimod.glayout.graph.topsort.EnhancedTopSorter
  • com.evelopers.unimod.glayout.graph.topsort.TopSorter
  • com.evelopers.unimod.glayout.graph.utils.AssociatedDigraph
    • 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.