Package com.evelopers.unimod.glayout.graph

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

30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
     *
     *
     * @param args
     */
    public static void main(String[] args) {
        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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
            sg.removePropertyAsc(ESUBGRAPH_KEY);

            return;
        }

        SimpleGraph blk = provideBLK(sg, cutpoints);

        sg.removePropertyAsc(ESUBGRAPH_KEY);

        // getting list to connect vertices
        ListIterator liv = blk.getVertices()
                              .listIterator();

        // toconnect will be from sg vertices
        List toconnect = new ArrayList();
View Full Code Here
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
     * @param sg
     * @param cutpoints
     * @return
     */
    private static SimpleGraph provideBLK(SimpleGraph sg, List cutpoints) {
        SimpleGraph blk = new SimpleGraph();

        // adding cutpoints
        ListIterator licp = cutpoints.listIterator();

        while (licp.hasNext()) {
            SimpleVertex element = (SimpleVertex) licp.next();
            SimpleVertex toadd   = new SimpleVertex();
            blk.addVertex(toadd);
            toadd.setProperty(CORRESP_KEY, element);
            element.setProperty(CORRESP_KEY, toadd);
        }

        // searching for biconn subgraph count
        int esub_count   = 0;
        ListIterator lie = sg.getEdges()
                             .listIterator();

        while (lie.hasNext()) {
            SimpleEdge element = (SimpleEdge) lie.next();
            int esub_n         = element.getIntProperty(ESUBGRAPH_KEY);

            if (esub_n > esub_count) {
                esub_count = esub_n;
            }
        }

        // creating vertices
        SimpleVertex[] white = new SimpleVertex[esub_count];

        for (int i = 0; i < white.length; i++) {
            white[i] = new SimpleVertex();
            blk.addVertex(white[i]);
        }

        // setting vertex corresp
        lie = sg.getEdges()
                .listIterator();

        while (lie.hasNext()) {
            SimpleEdge element  = (SimpleEdge) lie.next();
            SimpleVertex svcomp = white[element.getIntProperty(ESUBGRAPH_KEY) - 1];
            SimpleVertex v1     = element.getSource();
            SimpleVertex v2     = element.getTarget();

            //setting corresp vertex not from cutpoints
            if ((svcomp.getVertexProperty(CORRESP_KEY) == null)
                    || (!cutpoints.contains(v1))) {
                svcomp.setProperty(CORRESP_KEY, v1);
            }

            if ((svcomp.getVertexProperty(CORRESP_KEY) == null)
                    || (!cutpoints.contains(v2))) {
                svcomp.setProperty(CORRESP_KEY, v2);
            }
        }

        // adding edges
        licp = cutpoints.listIterator();

        while (licp.hasNext()) {
            SimpleVertex element = (SimpleVertex) licp.next();
            SimpleVertex svcutp  = element.getVertexProperty(CORRESP_KEY);
            ListIterator liedges = element.getEdgesRelative(sg)
                                          .listIterator();

            List v2c = new ArrayList();

            // but no duplicate edges
            while (liedges.hasNext()) {
                SimpleEdge edge     = (SimpleEdge) liedges.next();
                SimpleVertex svcomp = white[edge.getIntProperty(ESUBGRAPH_KEY) - 1];

                if (!v2c.contains(svcomp)) {
                    v2c.add(svcomp);
                }
            }

            ListIterator liv2c = v2c.listIterator();

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

                SimpleEdge toadd = new SimpleEdge(svcutp, vertex);
                blk.addEdge(toadd);
            }
        }

        sg.removePropertyAsc(CORRESP_KEY);

View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
        ListIterator li0 = sg.getVertices()
                             .listIterator();

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

            if (sgr != null) {
                iPaint(sgr, bg);
            }
        }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
    /**
     * Build a dighraph.
     */
    public void buildDigraph() {
        associated = new SimpleGraph();

        ListIterator lif = gd.getFaces()
                             .listIterator();

        while (lif.hasNext()) {
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
        return produce(false);
    }

    private SimpleGraph produce(boolean hor) {
        this.hor     = hor;
        ngraph       = new SimpleGraph();
        createVertices();
        createEdges();

        return ngraph;
    }
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
    /*
     *  (non-Javadoc)
     * @see com.evelopers.unimod.glayout.graph.utils.AssociatedDigraph#buildDigraph()
     */
    public void buildDigraph() {
        associated = new SimpleGraph();

        ListIterator lif = gd.getFaces()
                             .listIterator();

        while (lif.hasNext()) {
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
    public void construct() {
        /* there is no need to add corners there
         * 'cause they are needed before
         */
        NGraphProducer np = new NGraphProducer(sg);
        SimpleGraph nhor  = np.produceHorizontal();
        TopSorterFactory.getTopSorter(nhor)
                        .unitTopSort();

        ListIterator liv = sg.getVertices()
                             .listIterator();

        while (liv.hasNext()) {
            SimpleVertex sv      = (SimpleVertex) liv.next();
            SimpleVertex corresp = np.getCorrespondingVertex(sv);
            sv.setOrthX(corresp.getTopnum());
        }

        np.cleanProps();

        SimpleGraph nver = np.produceVertical();
        TopSorterFactory.getTopSorter(nver)
                        .unitTopSort();
        liv = sg.getVertices()
                .listIterator();

View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
    super(graph);
  }

  @Override
  public void execute(Object parent) {
    SimpleGraph sg = new SimpleGraph();   
    HashMap <mxCell, SimpleVertex> vertexes = new HashMap<mxCell, SimpleVertex>();
    for (Object obj : graph.getChildVertices(parent)) {
      if (obj instanceof mxCell) {
        mxCell cell = (mxCell) obj;
        SimpleVertex sv = new SimpleVertex();
        int width = (int) Math.round(cell.getGeometry().getWidth());
        int height = (int) Math.round(cell.getGeometry().getHeight());
        VertexExt ve = new VertexExt(cell.getGeometry().getPoint(), width, height);
        sv.setVertexext(ve);
        sv.setProperty("id", cell.getId());
        sg.addVertex(sv);
        vertexes.put(cell, sv);
      }
    }
    for (Object obj : graph.getChildEdges(parent)) {
      if (obj instanceof mxCell) {
        mxCell cell = (mxCell) obj;
        SimpleEdge se = new SimpleEdge(vertexes.get(cell.getSource()), vertexes.get(cell.getTarget()));
        se.setProperty("id", cell.getId());
        sg.addEdge(se);
      }
    }
    MultiLayerLayouter.layout(sg);
   
        mxCell someCell = ((mxCell)vertexes.keySet().toArray()[0]);
        double xscale = someCell.getGeometry().getWidth() / (vertexes.get(someCell).getVertexext().getWidth() - .5);
        double yscale = someCell.getGeometry().getHeight() / (vertexes.get(someCell).getVertexext().getHeight() - .5);
    for (Object obj : sg.getVertices()) {
      if (obj instanceof SimpleVertex) {
        SimpleVertex sv = (SimpleVertex) obj;
       
        for (mxCell vertex: vertexes.keySet()) {
          if (vertex.getId().equals(sv.getProperty("id"))) {
            VertexExt ve =  sv.getVertexext();
            mxGeometry vertexGeometry = vertex.getGeometry();
            super.setVertexLocation(vertex, ve.getLeftTop().getX()*xscale, ve.getLeftTop().getY()*yscale);
          }
        }
               
      }
    }
    for (Object obj : sg.getEdges()) {
      if (obj instanceof SimpleEdge) {
        SimpleEdge se = (SimpleEdge) obj;
        for (Object e : graph.getChildEdges(parent)) {
          if (e instanceof mxCell) {
            mxCell edge = (mxCell) e;
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
    /**
     *Orientate
     */
    public void construct() {
        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
TOP

Related Classes of com.evelopers.unimod.glayout.graph.SimpleGraph

  • com.evelopers.unimod.glayout.fast.AltMultiLayerBuilder
  • com.evelopers.unimod.glayout.fast.OneLayerLayouter
  • com.evelopers.unimod.glayout.graph.topsort.EnhancedTopSorter
  • 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.representations.compaction.GraphRectangulator$GraphsContainer
  • com.evelopers.unimod.glayout.representations.compaction.NGraphProducer
  • com.evelopers.unimod.glayout.representations.compaction.RectangularFacesCompactor
  • com.evelopers.unimod.glayout.representations.embedding.SimpleEmbedding
    • 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.