Examples of addVertex()

Examples of ca.eandb.jmist.framework.geometry.primitive.PolyhedronGeometry.addVertex()

223
224
225
226
227
228
229
230
231
232
233
      int nv = vertices[3].squaredDistanceTo(vertices[2]) < MathUtil.EPSILON ? 3 : 4;
      int offset = mesh.getNumVertices();

      for (int i = 0; i < nv; i++) {
        mesh.addVertex(vertices[i]);
      }

      mesh.addFace(new int[]{ offset + 0, offset + 1, offset + 2 });
      if (nv > 3) { // quad
        mesh.addFace(new int[]{ offset + 2, offset + 3, offset + 0 });
View Full Code Here

Examples of cascading.flow.planner.process.FlowStepGraph.addVertex()

135
136
137
138
139
140
141
142
143
144
145
    FlowStepGraph flowStepGraph = new FlowStepGraph();

    Tap sink = getSinksCollection().iterator().next();
    FlowStep<JobConf> step = new MapReduceFlowStep( getName(), sink.toString(), jobConf, sink );

    flowStepGraph.addVertex( step );

    return flowStepGraph;
    }

  protected Map<String, Tap> createSources( JobConf jobConf )
View Full Code Here

Examples of com.evelopers.unimod.glayout.graph.SimpleGraph.addVertex()

151
152
153
154
155
156
157
158
159
160
161
        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
View Full Code Here

Examples of com.evelopers.unimod.glayout.graph.containers.Chain.addVertex()

125
126
127
128
129
130
131
132
133
134
135
                                             SimpleVertex target) {
        Chain res = new Chain(f.getGraph());
        res.addEdge(e);

        SimpleEdge curre = e;
        res.addVertex(source);

        SimpleVertex curr = e.getAnother(source);
        res.addVertex(curr);

        while (curr != target) {
View Full Code Here

Examples of com.evelopers.unimod.glayout.graph.containers.Face.addVertex()

47
48
49
50
51
52
53
54
55
56
57
            SimpleEdge edge = (SimpleEdge) lie.next();
            SimpleVertex sv = new SimpleVertex();
            hm.put(edge, sv);
            sv.setProperty(BIGVERTEX_KEY, this);
            sg.addVertex(sv);
            f.addVertex(sv);
            vertices.add(sv);
        }

        // faces incident to vertex
        List faces = FaceHelper.getInstance(gd, sg)
View Full Code Here

Examples of com.evelopers.unimod.glayout.graph.containers.Path.addVertex()

100
101
102
103
104
105
106
107
108
109
110
        while (lie.hasNext()) {
            SimpleEdge edge = (SimpleEdge) lie.next();

            if (edge.getProperty(this) == null) {
                Path p = new Path(sg);
                p.addVertex(edge.getSource());
                p.addVertex(edge.getTarget());
                p.addEdge(edge);
                paths.add(p);
            }
        }
View Full Code Here

Examples of com.evelopers.unimod.glayout.graph.containers.Segment.addVertex()

186
187
188
189
190
191
192
193
194
195
196
                                   .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

Examples of com.puppetlabs.graph.elements.RootGraph.addVertex()

770
771
772
773
774
775
776
777
778
779
780
    // and one for the root/non-modular
    for(ModuleNodeData mnd : moduleNodeData.values()) {
      cancel.assertContinue();
      if(renderAll || mnd.marked)
        if(mnd.isNode())
          g.addVertex(createVertexForPPNodeNode(mnd));
        else
          g.addVertex(createVertexForModuleNode(mnd));
    }

    // only draw the root node if it has been marked (incoming dependency), or has outgoing
View Full Code Here

Examples of com.thinkaurelius.titan.core.TitanGraph.addVertex()

151
152
153
154
155
156
157
158
159
160
161

    private static void codeSnippets() throws Exception {
        TitanGraph g = TitanFactory.open("/tmp/titan");
        g.createKeyIndex("name", Vertex.class);
        Vertex juno = g.addVertex(null);
        juno.setProperty("name", "juno");
        juno = g.getVertices("name", "juno").iterator().next();

        TransactionalGraph tx = g.newTransaction();
        Thread[] threads = new Thread[10];
View Full Code Here

Examples of com.thinkaurelius.titan.core.TitanTransaction.addVertex()

87
88
89
90
91
92
93
94
95
96
97
        g.commit();

        TitanTransaction tx = g.newTransaction();
        // Add a vertex that has an out edge to every other vertex
        Vertex hiOutDeg = tx.addVertex(Schema.SUPERNODE_UID);
        String label = schema.getSupernodeOutLabel();
        TitanKey uidKey = tx.getPropertyKey(Schema.UID_PROP);
        hiOutDeg.setProperty(Schema.UID_PROP, Schema.SUPERNODE_UID);
        String pKey = schema.getSortKeyForLabel(label);
        for (long i = INITIAL_VERTEX_UID; i < schema.getVertexCount(); i++) {
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.