Package com.evelopers.unimod.glayout.graph

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

131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
                                    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);
View Full Code Here
187
188
189
190
191
192
193
194
195
196
197
198
        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()) {
View Full Code Here
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
        addCorner(Corner.RIGHTTOP);
    }

    private void addCorner(Corner corner) {
        IOrthItem acorner     = GeometricHelper.getAbstractCorner(sg, corner);
        SimpleVertex rcorner1 = GeometricHelper.getRealCorner(sg, corner, true);

        if (!CompactionHelper.equalsOrth(acorner, rcorner1)) {
            SimpleVertex rcorner2 = GeometricHelper.getRealCorner(sg, corner, false);
            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);

            GraphsContainer vgc = proceedBridge(tvertex, rcorner1, rcorner2);
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
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
        ListIterator li = tempg.getVertices()
                               .listIterator();

        while (li.hasNext()) {
            SimpleVertex element = (SimpleVertex) li.next();
            Integer ii           = (Integer) element.getProperty(this);
            ((Segment) currSegments.get(ii.intValue())).addVertex(element);
        }

        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
292
293
294
295
296
297
298
299
300
301
302
303
     */
    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();

View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
77
78
    private void processVertexListMain(List vertices) {
        if (vertices != null) {
            ListIterator li = vertices.listIterator();

            while (li.hasNext()) {
                SimpleVertex element = (SimpleVertex) li.next();
                SimpleGraph graph    =
                    (SimpleGraph) element.getProperty(Constant.LAYER_KEY);

                if (graph == null) {
                    continue;
                }
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
98
        List res        = new ArrayList();
        ListIterator li = graph.getVertices()
                               .listIterator();

        while (li.hasNext()) {
            SimpleVertex el = (SimpleVertex) li.next();
            SimpleGraph sgr = (SimpleGraph) el.getProperty(Constant.LAYER_KEY);

            if (sgr != null) {
                res.add(el);
            }
        }
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
168
169
    private void processVertexListPrep(List vertices) {
        if (vertices != null) {
            ListIterator li = vertices.listIterator();

            while (li.hasNext()) {
                SimpleVertex element = (SimpleVertex) li.next();
                SimpleGraph graph    =
                    (SimpleGraph) element.getProperty(Constant.LAYER_KEY);

                if (graph == null) {
                    continue;
                }
View Full Code Here
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
        List res        = new ArrayList();
        ListIterator li = graph.getVertices()
                               .listIterator();

        while (li.hasNext()) {
            SimpleVertex el = (SimpleVertex) li.next();
            SimpleGraph sgr = (SimpleGraph) el.getProperty(Constant.LAYER_KEY);

            if (sgr != null) {
                res.add(el);
                sgr.setProperty(FICTIVEADDED_KEY, Boolean.FALSE);
            }
        }

        processVertexListPrep(res);

        List lower = new ArrayList();
        li = graph.getVertices()
                  .listIterator();

        while (li.hasNext()) {
            SimpleVertex el = (SimpleVertex) li.next();
            SimpleGraph sgr = (SimpleGraph) el.getProperty(Constant.LAYER_KEY);

            if (sgr != null) {
                lower.addAll(sgr.getVertices());

                List l = (List) sgr.getProperty(LOWERV_KEY);
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
     *                  1  target
     *                  2 st
     */
    private void preBuildSTEdge(SimpleEdge edge, int issource) {
        List edges;
        SimpleVertex vertex;
        int st;

        if (issource == -1) {
            vertex     = gd.getSource();
            edges      = vertex.getEdgesOutgoing();
        } else {
            vertex     = gd.getTarget();
            edges      = vertex.getEdgesIncoming();
        }

        st = issource;

        if ((edges.size() == 4)
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.