Package com.evelopers.unimod.glayout.graph.containers

Examples of com.evelopers.unimod.glayout.graph.containers.Chain

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
    /*
     * unoriented method
     */
    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
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
    private void countProperties() {
        /* chain is better then face anyway
         * 'cause it is in the proper order
         * must be ccw
         */
        Chain c =
            GraphHelper.getInstance()
                       .dfsChainSearchUnOri(f,
                                            new Chain(f),
                                            (SimpleVertex) f.getVertices().get(0),
                                            (SimpleVertex) f.getVertices().get(0));
        f.removePropertyAsc(GraphHelper.getInstance());

        // the uppermost edge
        SimpleEdge upperedge = GeometricHelper.getUpperEdge(c);

        // index of the next for upper
        int nexti;

        if (c.getEdges()
                 .indexOf(upperedge) == (c.getEdges()
                                              .size() - 1)) {
            nexti = 0;
        } else {
            nexti = c.getEdges()
                     .indexOf(upperedge) + 1;
        }

        // whether order is ccw or cw
        SimpleEdge nextupper = (SimpleEdge) c.getEdges()
                                             .get(nexti);

        if (!CompactionHelper.getIntersection(upperedge, nextupper)
                                 .equals(GeometricHelper.getRightVetrtex(upperedge))) {
            Collections.reverse(c.getEdges());
        }

        SimpleEdge[] edges = (SimpleEdge[]) c.getEdges()
                                             .toArray(new SimpleEdge[0]);
        SimpleEdge prev = edges[edges.length - 1];

        for (int i = 0; i < edges.length; i++) {
            SimpleEdge curr     = edges[i];
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
        SimpleGraph temp = new SimpleGraph();
        GraphHelper.instanceCopy(getGraph(),
                                 temp);

        while (true) {
            Chain ac = new Chain(temp);
            ac = GraphHelper.getInstance()
                            .dfsChainSearchUnOri(temp,
                                                 ac,
                                                 gd.getSource(),
                                                 gd.getTarget());
            getGraph()
                .removePropertyAsc(GraphHelper.getInstance());

            if (ac == null) {
                break;
            }

            orientOnSTChain(ac);
            temp.removeEdges(ac.getEdges());
        }
    }
View Full Code Here
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
        dontgo.setProperty(GraphHelper.getInstance(),
                           GraphHelper.getInstance());

        // chain for face
        Face tface = new Face(sg);
        Chain ac   = new Chain(tface);
        GraphHelper.instanceCopy(gd.getOuterLeft(),
                                 tface);
        GraphHelper.instanceCopy(gd.getOuterRight(),
                                 tface);
        ac = GraphHelper.getInstance()
                        .dfsChainSearchUnOri(tface, ac, v1, v2);
        sg.removePropertyAsc(GraphHelper.getInstance());

        Face f = new Face(sg);

        GraphsContainer vgc = new GraphsContainer(sg, f);
        f.addEdges(ac.getEdges());
        f.addVertices(ac.getVertices());
        f.setProperty(FICTIVE_KEY, FICTIVE_VALUE);
        gd.getFaces()
          .add(f);

        return vgc;
View Full Code Here
212
213
214
215
216
217
218
219
220
221
222
    /**
     * Get outer face two set
     * @return result
     */
    protected GContainer getOuter() {
        Chain temp = new Chain(tempg);
        temp =
            GraphHelper.getInstance()
                       .dfsChainSearchUnOri(tempg, temp,
                                            (SimpleVertex) tempg.getVertices().get(0),
                                            (SimpleVertex) tempg.getVertices().get(0));
View Full Code Here
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
     * @param s
     */
    private void addAlphaChain(Segment s) {
        ListIterator li = gd.getFaces()
                            .listIterator();
        Chain ac            = null;
        SimpleVertex source = null;
        SimpleVertex target = null;
        Face cface          = null;

        while (li.hasNext()) {
            cface = (Face) li.next();

            if (cface.isAdmissible(s)) {
                List contactvertices = s.getCV();

                if (contactvertices.size() > 0) {
                    source = (SimpleVertex) contactvertices.get(0);

                    if (contactvertices.size() == 1) {
                        target = source;
                    } else {
                        target = (SimpleVertex) contactvertices.get(1);
                    }

                    ac = s.getAChain(tempg, source, target);

                    break;
                }
            }
        }

        Face f = cface.split(ac, source, target);
        gd.getFaces()
          .add(f);
        GraphHelper.instanceCopy(ac, planarg);
        tempg.removeEdges(ac.getEdges());
        tempg.removeVertices(ac.getVertices());
    }
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
     * preverify that face is cyclic
     * @param f face to check
     * @return result
     */
    public boolean isCycle(Face f) {
        Chain ac        = new Chain(f.getGraph());
        SimpleVertex sv = (SimpleVertex) f.getVertices()
                                          .get(0);
        ac              = GraphHelper.getInstance()
                                     .dfsChainSearchOri(f, ac, sv, sv);

View Full Code Here
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
                    return ac;
                }

                if (svc.getProperty(this) == null) {
                    Chain acc = (Chain) ac.instanceCopy();
                    acc.addEdge(element);
                    acc.addVertex(svc);

                    Chain res = dfsChainSearch(sg, acc, svc, target, ori);

                    if (res != null) {
                        return res;
                    }
                }
View Full Code Here
TOP

Related Classes of com.evelopers.unimod.glayout.graph.containers.Chain

  • com.evelopers.unimod.glayout.helpers.FaceHelper
  • com.evelopers.unimod.glayout.helpers.GraphHelper
  • com.evelopers.unimod.glayout.helpers.InvestigatorHelper
  • com.evelopers.unimod.glayout.representations.compaction.FaceRectangulator
  • com.evelopers.unimod.glayout.representations.compaction.GraphRectangulator
  • com.evelopers.unimod.glayout.representations.embedding.SimpleEmbedding
  • com.evelopers.unimod.glayout.representations.orientation.Orientation
    • 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.