Package com.mxgraph.view

Examples of com.mxgraph.view.mxGraph.insertEdge()

37
38
39
40
41
42
43
44
45
46
47
              "",
              v1,
              v2,
              "edgeStyle=elbowEdgeStyle;elbow=horizontal;"
                  + "exitX=0.5;exitY=1;exitPerimeter=1;entryX=0;entryY=0;entryPerimeter=1;");
      Object e2 = graph.insertEdge(parent, null, "", v3, v2,
          "edgeStyle=elbowEdgeStyle;elbow=horizontal;orthogonal=0;"
              + "entryX=0;entryY=0;entryPerimeter=1;");
    }
    finally
    {
View Full Code Here
28
29
30
31
32
33
34
35
36
37
38
    {
       Object v1 = graph.insertVertex(parent, null, "Hello", 20, 20, 80,
             30);
       Object v2 = graph.insertVertex(parent, null, "World!",
             240, 150, 80, 30);
       graph.insertEdge(parent, null, "Edge", v1, v2);
    }
    finally
    {
       graph.getModel().endUpdate();
    }
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
          .cloneNode(true), 200, 140, 80, 30);
      graph.insertVertex(parent, null, subtargetNode, 200,
          200, 80, 30);
      Object v6 = graph.insertVertex(parent, null, sourceNode
          .cloneNode(true), 20, 140, 80, 30);
      graph.insertEdge(parent, null, "", v1, v2);
      graph.insertEdge(parent, null, "", v1, v3);
      graph.insertEdge(parent, null, "", v6, v4);
      //Object e4 = graph.insertEdge(parent, null, "", v1, v4);
    }
    finally
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
      graph.insertVertex(parent, null, subtargetNode, 200,
          200, 80, 30);
      Object v6 = graph.insertVertex(parent, null, sourceNode
          .cloneNode(true), 20, 140, 80, 30);
      graph.insertEdge(parent, null, "", v1, v2);
      graph.insertEdge(parent, null, "", v1, v3);
      graph.insertEdge(parent, null, "", v6, v4);
      //Object e4 = graph.insertEdge(parent, null, "", v1, v4);
    }
    finally
    {
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
      {
        Object vertex2 = vertices[j];

        if (vertex1 != vertex2 && !mxGraphStructure.areConnected(aGraph, vertex1, vertex2))
        {
          graph.insertEdge(parent, null, getNewEdgeValue(aGraph), vertex1, vertex2);
        }
      }
    }
  };
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
        Object currVertex = vertices[vertexCount];

        if (i > 0)
        {
          // connect with previous x
          graph.insertEdge(parent, null, getNewEdgeValue(aGraph), vertices[vertexCount - 1], currVertex);
        }

        if (j > 0)
        {
          //connect with previous y
View Full Code Here
141
142
143
144
145
146
147
148
149
150
151
        }

        if (j > 0)
        {
          //connect with previous y
          graph.insertEdge(parent, null, getNewEdgeValue(aGraph), vertices[vertexCount - numColumns], currVertex);
        }

        vertexCount++;
      }
    }
View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
    for (int i = 0; i < numVerticesGroup1; i++)
    {
      Object currVertex = vertices[i];
      Object destVertex = vertices[getRandomInt(numVerticesGroup1, numVertices - 1)];
      graph.insertEdge(parent, null, getNewEdgeValue(aGraph), currVertex, destVertex);
    }

    for (int j = 0; j < numVerticesGroup2; j++)
    {
      Object currVertex = vertices[numVerticesGroup1 + j];
View Full Code Here
220
221
222
223
224
225
226
227
228
229
230
      int edgeNum = aGraph.getOpposites(aGraph.getEdges(currVertex, null, true, true, false, true), currVertex, true, true).length;

      if (edgeNum == 0)
      {
        Object destVertex = vertices[getRandomInt(0, numVerticesGroup1 - 1)];
        graph.insertEdge(parent, null, getNewEdgeValue(aGraph), currVertex, destVertex);
      }
    }
  };

  /**
 
View Full Code Here
366
367
368
369
370
371
372
373
374
375
376
    // find a random vertex in each group and connect them.
    for (int i = 1; i < componentNum; i++)
    {
      Object sourceVertex = components[i - 1][(int) Math.round(Math.random() * (components[i - 1].length - 1))];
      Object targetVertex = components[i][(int) Math.round(Math.random() * (components[i].length - 1))];
      graph.insertEdge(parent, null, aGraph.getGenerator().getNewEdgeValue(aGraph), sourceVertex, targetVertex);
    }
  };

  /**
   * @param aGraph
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.