Package edu.uci.ics.jung.graph

Examples of edu.uci.ics.jung.graph.Graph.addVertex()

65
66
67
68
69
70
71
72
73
74
75
    v3.setUserDatum("Deepness", 2,UserData.SHARED);
    v4.setUserDatum("ID", "444", UserData.SHARED);
    v4.setUserDatum("Name","v4Name",UserData.SHARED);
    v4.setUserDatum("Description", "Node 4 Description", UserData.SHARED);
    v4.setUserDatum("Deepness", 1,UserData.SHARED);
    g.addVertex(v1);
    g.addVertex(v2);
    g.addVertex(v3);
    g.addVertex(v4);
    Edge e12 = new DirectedSparseEdge(v1, v2);
    e12.setUserDatum("ID", "12", UserData.SHARED);
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
    v4.setUserDatum("ID", "444", UserData.SHARED);
    v4.setUserDatum("Name","v4Name",UserData.SHARED);
    v4.setUserDatum("Description", "Node 4 Description", UserData.SHARED);
    v4.setUserDatum("Deepness", 1,UserData.SHARED);
    g.addVertex(v1);
    g.addVertex(v2);
    g.addVertex(v3);
    g.addVertex(v4);
    Edge e12 = new DirectedSparseEdge(v1, v2);
    e12.setUserDatum("ID", "12", UserData.SHARED);
    e12.setUserDatum("Name", "myEdge12", UserData.SHARED);
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
    v4.setUserDatum("Name","v4Name",UserData.SHARED);
    v4.setUserDatum("Description", "Node 4 Description", UserData.SHARED);
    v4.setUserDatum("Deepness", 1,UserData.SHARED);
    g.addVertex(v1);
    g.addVertex(v2);
    g.addVertex(v3);
    g.addVertex(v4);
    Edge e12 = new DirectedSparseEdge(v1, v2);
    e12.setUserDatum("ID", "12", UserData.SHARED);
    e12.setUserDatum("Name", "myEdge12", UserData.SHARED);
    e12.setUserDatum("Description", "myEdge 12 description", UserData.SHARED);
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
    v4.setUserDatum("Description", "Node 4 Description", UserData.SHARED);
    v4.setUserDatum("Deepness", 1,UserData.SHARED);
    g.addVertex(v1);
    g.addVertex(v2);
    g.addVertex(v3);
    g.addVertex(v4);
    Edge e12 = new DirectedSparseEdge(v1, v2);
    e12.setUserDatum("ID", "12", UserData.SHARED);
    e12.setUserDatum("Name", "myEdge12", UserData.SHARED);
    e12.setUserDatum("Description", "myEdge 12 description", UserData.SHARED);
    e12.setUserDatum("Deepness", 2, UserData.SHARED);
View Full Code Here
181
182
183
184
185
186
187
188
189
190
191
    ResIterator topicsIter = model.listSubjectsWithProperty(RDF.type,
        KNOBOT.Topic);
    Map vertexTopic = new HashMap();
    while (topicsIter.hasNext()) {
      Resource element = topicsIter.nextResource();
      Vertex vertex = (Vertex) g.addVertex(new DirectedSparseVertex());
      vertexTopic.put(element, vertex);
      vertex.addUserDatum("label", element.getURI(), UserData.SHARED);
    }
    Iterator vertexIter = vertexTopic.keySet().iterator();
    Map allTopicsAndItems = new HashMap();
View Full Code Here
214
215
216
217
218
219
220
221
222
223
224
          //is an item

          Vertex vertex;
          vertex = (Vertex) allTopicsAndItems.get(target);
          if (vertex == null) {
            vertex = (Vertex) g
                .addVertex(new DirectedSparseVertex());
            vertex.addUserDatum("label", target.getURI(),
                UserData.SHARED);
            allTopicsAndItems.put(target, vertex);
          }
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
       
        // add all vertices in the delegate, unless the vertex is in the
        // cluster.
        for(Object v : inGraph.getVertices()) {
            if(cluster.contains(v) == false) {
                graph.addVertex(v);
            }
        }
        // add the clusterGraph as a vertex
        graph.addVertex(clusterGraph);
       
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
            if(cluster.contains(v) == false) {
                graph.addVertex(v);
            }
        }
        // add the clusterGraph as a vertex
        graph.addVertex(clusterGraph);
       
        //add all edges from the inGraph, unless both endpoints of
        // the edge are in the cluster
        for(Object e : (Collection<?>)inGraph.getEdges()) {
            Pair endpoints = inGraph.getEndpoints(e);
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
        Collection cluster = clusterGraph.getVertices();
        logger.fine("cluster to expand is "+cluster);

        // put all clusterGraph vertices and edges into the new Graph
        for(Object v : cluster) {
            graph.addVertex(v);
            for(Object edge : clusterGraph.getIncidentEdges(v)) {
                Pair endpoints = clusterGraph.getEndpoints(edge);
                graph.addEdge(edge, endpoints.getFirst(), endpoints.getSecond(), clusterGraph.getEdgeType(edge));
            }
        }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
        }
        // add all the vertices from the current graph except for
        // the cluster we are expanding
        for(Object v : inGraph.getVertices()) {
            if(v.equals(clusterGraph) == false) {
                graph.addVertex(v);
            }
        }

        // now that all vertices have been added, add the edges,
        // ensuring that no edge contains a vertex that has not
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.