Package edu.uci.ics.jung.graph

Examples of edu.uci.ics.jung.graph.Vertex.addUserDatum()

926
927
928
929
930
931
932
933
934
935
936
  public static void numberVertices(DirectedSparseGraph pta){
    Iterator<Vertex> vertexIt = getBFSList(pta).iterator();
    while(vertexIt.hasNext()){
      Vertex v = vertexIt.next();
      v.removeUserDatum(JUConstants.LABEL);// since we'd like this method to run multiple times, once immediately after initialisation and subsequently when sPlus and sMinus are added.
      v.addUserDatum(JUConstants.LABEL, v.toString(), UserData.SHARED);
    }
  }

  public static List<Vertex> getBFSList(Graph g){
    List<Vertex> queue = new LinkedList<Vertex>();
View Full Code Here
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
 
  private final void testChooseStatePairsInternal(DirectedSparseGraph g, String [] initialReds, String [][] expectedReds, List<PairScore> expectedPairs,InterfaceChooserToTest chooser)
  {
    for(String red:initialReds)
    {
      Vertex v = findVertex(JUConstants.LABEL, red, g);v.removeUserDatum("colour");v.addUserDatum("colour", "red", UserData.SHARED);
    }
    Stack<? extends StatePair> pairs = chooser.choosePairs();
    Map<Integer,Set<PairScore>> distribution = new HashMap<Integer,Set<PairScore>>();// maps scores to sets of states which should correspond to them. The aim is to verify the contents of the stack regardless of the order in which elements with the same score are arranged.

    Set<Set<String>> expectedRedsAsSet = new HashSet<Set<String>>();
View Full Code Here
928
929
930
931
932
933
934
935
936
937
938
  public static void numberVertices(DirectedSparseGraph pta){
    Iterator<Vertex> vertexIt = getBFSList(pta).iterator();
    while(vertexIt.hasNext()){
      Vertex v = vertexIt.next();
      v.removeUserDatum(JUConstants.LABEL);// since we'd like this method to run multiple times, once immediately after initialisation and subsequently when sPlus and sMinus are added.
      v.addUserDatum(JUConstants.LABEL, v.toString(), UserData.SHARED);
    }
  }

  public static List<Vertex> getBFSList(Graph g){
    List<Vertex> queue = new LinkedList<Vertex>();
View Full Code Here
793
794
795
796
797
798
799
800
801
802
803
  public static void numberVertices(DirectedSparseGraph pta){
    Iterator<Vertex> vertexIt = getBFSList(pta).iterator();
    while(vertexIt.hasNext()){
      Vertex v = vertexIt.next();
      v.removeUserDatum(JUConstants.LABEL);// since we'd like this method to run multiple times, once immediately after initialisation and subsequently when sPlus and sMinus are added.
      v.addUserDatum(JUConstants.LABEL, v.toString(), UserData.SHARED);
    }
  }

  public static List<Vertex> getBFSList(Graph g){
    List<Vertex> queue = new LinkedList<Vertex>();
View Full Code Here
836
837
838
839
840
841
842
843
844
845
846
  public static void numberVertices(DirectedSparseGraph pta){
    Iterator<Vertex> vertexIt = getBFSList(pta).iterator();
    while(vertexIt.hasNext()){
      Vertex v = vertexIt.next();
      v.removeUserDatum(JUConstants.LABEL);// since we'd like this method to run multiple times, once immediately after initialisation and subsequently when sPlus and sMinus are added.
      v.addUserDatum(JUConstants.LABEL, v.toString(), UserData.SHARED);
    }
  }

  public static List<Vertex> getBFSList(Graph g){
    List<Vertex> queue = new LinkedList<Vertex>();
View Full Code Here
770
771
772
773
774
775
776
777
778
779
780
  public static void numberVertices(DirectedSparseGraph pta){
    Iterator<Vertex> vertexIt = getBFSList(pta).iterator();
    while(vertexIt.hasNext()){
      Vertex v = vertexIt.next();
      v.removeUserDatum(JUConstants.LABEL);// since we'd like this method to run multiple times, once immediately after initialisation and subsequently when sPlus and sMinus are added.
      v.addUserDatum(JUConstants.LABEL, v.toString(), UserData.SHARED);
    }
  }

  public static List<Vertex> getBFSList(Graph g){
    List<Vertex> queue = new LinkedList<Vertex>();
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
                        UserData.SHARED);
        jungVertex.setUserDatum(GraphAttributeType.DEEPNESS, n.getDeepness(), UserData.SHARED);

        if (n.getMetricAttribute() != null && n.getMetricAttribute().size() > 0)
            if (n.getMetricAttribute().get(0).getName().equals("SIZE"))
                jungVertex.addUserDatum(
                        GraphAttributeType.SIZE,
                        n.getMetricAttribute().get(0).getValue(),
                        UserData.SHARED);
       
//        System.out.println("Converting " + n.getId()) ;
View Full Code Here
183
184
185
186
187
188
189
190
191
192
193
    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();
    allTopicsAndItems.putAll(vertexTopic);
    while (vertexIter.hasNext()) {
View Full Code Here
216
217
218
219
220
221
222
223
224
225
226
          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);
          }
          DirectedEdge e = (DirectedEdge) g
              .addEdge(new DirectedSparseEdge(
View Full Code Here
381
382
383
384
385
386
387
388
389
390
391
      for (Iterator<?> iter = getGraph().getVertices().iterator(); iter.hasNext();) {
        Vertex v = (Vertex) iter.next();
        Coordinates coord = (Coordinates) v.getUserDatum(getBaseKey());
        if (coord == null) {
          coord = new Coordinates();
          v.addUserDatum(getBaseKey(), coord, UserData.REMOVE);
          initializeLocation(v, coord, getCurrentSize());
          initialize_local_vertex(v);
        }
      }
    } catch (ConcurrentModificationException cme) {
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.