Package com.evelopers.unimod.glayout.graph

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

51
52
53
54
55
56
57
58
59
60
61
62
63
    public SimpleVertex getOrig() {
        ListIterator li = this.getVertices()
                              .listIterator();

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

            if (element.getEdgesRelativeIncoming(this)
                           .size() == 0) {
                return element;
            }
        }
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
82
83
    public SimpleVertex getDest() {
        ListIterator li = this.getVertices()
                              .listIterator();

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

            if (element.getEdgesRelativeOutgoing(this)
                           .size() == 0) {
                return element;
            }
        }
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
    public boolean isAdmissible(Segment s) {
        ListIterator li = s.getVertices()
                           .listIterator();

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

            if ((s.isContactVertex(element))
                    && (this.getVertices()
                                .indexOf(element) == -1)) {
                return false;
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
        List cv         = new ArrayList();
        ListIterator li = getVertices()
                              .listIterator();

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

            if (isContactVertex(element)) {
                cv.add(element);
            }
        }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
55
56
        ListIterator li = sg.getVertices()
                            .listIterator();

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

            if (element.getProperty(this) != i) {
                sg.removePropertyAsc(this);

                return false;
            }
        }
View Full Code Here
53
54
55
56
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
        ListIterator liv = sg.getVertices()
                             .listIterator();

        while (liv.hasNext()) {
            SimpleVertex vertex = (SimpleVertex) liv.next();

            if (vertex == gd.getSource()) {
                if (vertex.getEdgesRelativeIncoming(sg)
                              .size() != 0) {
                    return false;
                }
            } else if (vertex == gd.getTarget()) {
                if (vertex.getEdgesRelativeOutgoing(sg)
                              .size() != 0) {
                    return false;
                }
            } else {
                if (vertex.getEdgesRelativeOutgoing(sg)
                              .size() == 0) {
                    return false;
                }

                if (vertex.getEdgesRelativeOutgoing(sg)
                              .size() == 0) {
                    return false;
                }
            }
        }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
        ListIterator li = sg.getVertices()
                            .listIterator();

        while (li.hasNext()) {
            SimpleVertex v = (SimpleVertex) li.next();
            bg.setColor(Color.BLACK);
            bg.drawLine(xconvert(v.getVisXL()),
                        yconvert(v.getVisY()),
                        xconvert(v.getVisXR()),
                        yconvert(v.getVisY()));
            bg.drawString("v" + v.getId(), xconvert(v.getVisXL()) + (Consts.VR / 2),
                          yconvert(v.getVisY()) - (Consts.VR / 2));
        }

        li = sg.getEdges()
               .listIterator();
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
46
47
        SimpleGraph sg  = GraphGenerator.generateTriangles();
        SimpleGraph sg1 = GraphGenerator.generateOneV();
        ((SimpleVertex) sg.getVertices()
                          .get(2)).setProperty(Constant.LAYER_KEY, sg1);

        SimpleVertex test1 = (SimpleVertex) sg.getVertices()
                                              .get(3);
        SimpleVertex test2 = (SimpleVertex) sg1.getVertices()
                                               .get(0);
        SimpleEdge e = new SimpleEdge(test2, test1);
        sg.addEdge(e);

        long time = System.currentTimeMillis();
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
77
        SimpleVertex[] arr = new SimpleVertex[count];
        ListIterator li    = g.getVertices()
                              .listIterator();

        while (li.hasNext()) {
            SimpleVertex element = (SimpleVertex) li.next();
            arr[element.getIntProperty(COMP_KEY)] = element;
        }

        g.removePropertyAsc(COMP_KEY);

        for (int i = 0; i < (count - 1); i++) {
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
        // toconnect will be from sg vertices
        List toconnect = new ArrayList();

        while (liv.hasNext()) {
            SimpleVertex vertex = (SimpleVertex) liv.next();

            if (vertex.getEdges()
                          .size() == 1) {
                toconnect.add(vertex.getVertexProperty(CORRESP_KEY));
            }
        }

        // biconnecting
        ListIterator li2c  = toconnect.listIterator();
        SimpleVertex vprev = (SimpleVertex) li2c.next();

        while (li2c.hasNext()) {
            SimpleVertex vnext = (SimpleVertex) li2c.next();

            SimpleEdge e = new SimpleEdge(vprev, vnext);
            e.setProperty(FICTIVEEDGEBICONN_KEY, FICTIVEVALUE);
            sg.addEdge(e);
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.