Package com.evelopers.unimod.glayout.graph

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

70
71
72
73
74
75
76
77
78
79
80
81
82
83
            super();
            this.v = v;
        }

        public int compare(Object o1, Object o2) {
            SimpleEdge e1   = (SimpleEdge) o1;
            SimpleEdge e2   = (SimpleEdge) o2;
            SimpleVertex v1 = e1.getAnother(v);
            SimpleVertex v2 = e2.getAnother(v);
            double x1       =
                Math.abs(v1.getVertexext().getLeftTop().getX()
                         - v.getVertexext().getLeftTop().getX());
            double x2 =
                Math.abs(v2.getVertexext().getLeftTop().getX()
View Full Code Here
80
81
82
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
108
109
110
111
112
113
114
115
116
117
118
119
        for1.setProperty(ISOLD_KEY, Boolean.TRUE);

        int n = sg.getVertices()
                  .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()
                                    .listIterator();
                LinkedList templl = new LinkedList();

                while (lie.hasNext()) {
                    templl.addLast(sv);
                    anEdge     = (SimpleEdge) lie.next();
                    sv         = anEdge.getAnother(sv);
                }

                while (!templl.isEmpty()) {
                    ll.addLast(templl.removeLast());
                }
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
105
            li = sv.getEdges()
                   .listIterator();
        }

        while (li.hasNext()) {
            SimpleEdge element = (SimpleEdge) li.next();
            SimpleVertex svc   = element.getAnother(sv);

            if ((sg.getVertices()
                       .indexOf(sv) != -1) && (sg.getVertices()
                                                     .indexOf(svc) != -1)
                    && (sg.getEdges()
View Full Code Here
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
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
262
263
264
    private Path pathFind(SimpleVertex sv) {
        // Shimon Even - Graph Algorithms - p 181
        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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
            li = current.getEdges()
                        .listIterator();
        }

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

            if (sg.getEdges()
                      .indexOf(element) != -1) {
                SimpleVertex svc = element.getAnother(current);

                if ((svc == target) && (ac.getEdges()
                                              .indexOf(element) == -1)) {
                    ac.addEdge(element);
                    ac.addVertex(svc);
View Full Code Here
263
264
265
266
267
268
269
270
271
272
273
     */
    public SimpleEdge getMedianEdge13(SimpleVertex v, List edges) {
        ListIterator li = edges.listIterator();

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

            // median for deg == 1
            if ((v.getLeft()
                      .getEdges()
                      .indexOf(element) != -1)
View Full Code Here
281
282
283
284
285
286
287
288
289
290
291
                sv[i].setOrthY(vnums[i][1]);
            }
        }

        for (int i = 0; i < se.length; i++) {
            se[i] = new SimpleEdge(sv[enums[i][0]], sv[enums[i][1]]);
        }

        sg.addEdges(Arrays.asList(se));
        sg.addVertices(Arrays.asList(sv));
View Full Code Here
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
            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;
View Full Code Here
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
    public static boolean haveCommonEdges(Path p1, Path p2) {
        ListIterator li = p1.getEdges()
                            .listIterator();

        while (li.hasNext()) {
            SimpleEdge element1 = (SimpleEdge) li.next();
            ListIterator li2    = p2.getEdges()
                                    .listIterator();

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

                if (element1.equals(element2)) {
                    return true;
                }
            }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
    public void parameterizedTopSort(double weight, double startnum) {
        ListIterator li = sg.getEdges()
                            .listIterator();

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

        weightedTopSort(startnum);
    }
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.