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

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

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
        // to prevent going this way
        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
293
294
295
296
297
298
299
300
301
302
303
304
305
    private void iterateFaces() {
        ListIterator li = gd.getFaces()
                            .listIterator();

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

            if ((!face.equals(gd.getOuterLeft())) && (!face.equals(gd.getOuterRight()))) {
                FaceRectangulator.getInstance(face, sg)
                                 .rectangulate();
            }
        }
    }
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
    }

    private void fixOuter() {
        ListIterator li = gd.getFaces()
                            .listIterator();
        Face curr = (Face) li.next();

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

            if (face.getVertices()
                        .size() > curr.getVertices()
                                          .size()) {
                curr = face;
            }
        }
View Full Code Here
230
231
232
233
234
235
236
237
238
239
240
241
    /**
     * Set outer face for graph
     * @param gcont
     */
    protected void setOuter(GContainer gcont) {
        Face f = new Face(planarg);
        gd.setOuter(new Face(planarg));
        GraphHelper.instanceCopy(gcont, f);
        GraphHelper.instanceCopy(gcont,
                                 gd.getOuter());
        GraphHelper.instanceCopy(gcont, planarg);
        tempg.removeEdges(gcont.getEdges());
View Full Code Here
259
260
261
262
263
264
265
266
267
268
269
270
271
            ListIterator li2 = gd.getFaces()
                                 .listIterator();
            int count = 0;

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

                if (element2.isAdmissible(element)) {
                    count++;
                }
            }

            if (count == 0) {
View Full Code Here
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
        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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
        SimpleEmbedding emb = new SimpleEmbedding(sg, gd);
        emb.construct();

        ListIterator li = gd.getFaces()
                            .listIterator();
        Face curr = (Face) li.next();

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

            if (face.getVertices()
                        .size() > curr.getVertices()
                                          .size()) {
                curr = face;
            }
        }
View Full Code Here
28
29
30
31
32
33
34
35
36
37
38
39
    /*
     *  (non-Javadoc)
     * @see com.evelopers.unimod.glayout.representations.embedding.SimpleEmbedding#setOuter(com.evelopers.unimod.glayout.graph.containers.GContainer)
     */
    protected void setOuter(GContainer gcont) {
        Face f1 = new Face(planarg);
        Face f2 = new Face(planarg);
        gd.setOuter(f2);
        GraphHelper.instanceCopy(gcont, f1);
        GraphHelper.instanceCopy(gcont, f2);
        GraphHelper.instanceCopy(gcont, planarg);
        tempg.removeEdges(gcont.getEdges());
View Full Code Here
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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
     * Sets source and target too.
     * @param f face to split
     * @return new faces array generated
     */
    public Face[] faceTravel(Face f) {
        Face resLeft  = new Face(f.getGraph());
        Face resRight = new Face(f.getGraph());
        GraphHelper.instanceCopy(f, resRight);

        int route = f.getVertices()
                     .size() / 2;
        SimpleVertex prev = null;
        SimpleVertex curr = (SimpleVertex) f.getVertices()
                                            .get(0);
        gd.setSource(curr);
        resLeft.addVertex(curr);

        while (route > 0) {
            ListIterator li = curr.getEdges()
                                  .listIterator();

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

                if ((f.getEdges()
                          .indexOf(element) != -1) && (element.getAnother(curr) != prev)) {
                    prev     = curr;
                    curr     = element.getAnother(curr);
                    resLeft.addVertex(curr);
                    resLeft.addEdge(element);
                    route--;

                    break;
                }
            }
        }

        gd.setTarget(curr);
        resRight.removeVertices(resLeft.getVertices());
        resRight.removeEdges(resLeft.getEdges());
        resRight.addVertex(gd.getSource());
        resRight.addVertex(gd.getTarget());

        return new Face[] { resLeft, resRight };
    }
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
120
121
        List res        = new ArrayList();
        ListIterator li = gd.getFaces()
                            .listIterator();

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

            if (element.getVertices()
                           .indexOf(sv) != -1) {
                res.add(element);
            }
        }
View Full Code Here
TOP

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

  • com.evelopers.unimod.glayout.graph.BigVertex
  • com.evelopers.unimod.glayout.graph.SimpleODItem
  • com.evelopers.unimod.glayout.graph.SimpleVertex
  • com.evelopers.unimod.glayout.graph.utils.AssociatedDigraph
  • com.evelopers.unimod.glayout.graph.utils.PathsAssociatedDigraph
  • com.evelopers.unimod.glayout.helpers.FaceHelper
  • com.evelopers.unimod.glayout.helpers.InvestigatorHelper
  • com.evelopers.unimod.glayout.representations.compaction.GraphRectangulator
  • com.evelopers.unimod.glayout.representations.embedding.EnhancedEmbedding
  • com.evelopers.unimod.glayout.representations.embedding.LargestFaceEmbedding
    • 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.