Examples of removeUserDatum()


Examples of edu.uci.ics.jung.graph.Edge.removeUserDatum()

  private void saveGraph() {
    GraphMLFile writer = new GraphMLFile();
    Graph g = (Graph) graph.copy();
    for (Iterator edges = g.getEdges().iterator(); edges.hasNext();) {
      Edge e = (Edge) edges.next();
      e.removeUserDatum(SERVICE_LIST);
    }

    writer.save(g, System.getProperty("user.home")
        + File.separator
        + "convertGraph.xml");
View Full Code Here

Examples of edu.uci.ics.jung.graph.Edge.removeUserDatum()

                        et = (NexsmEdgeType)e.getUserDatum("edgetype");
                        if (e.getUserDatum(userdatumkey + key) != null) {
                            show = (Boolean)e.getUserDatum(userdatumkey + key);
                            if (show != null &&
                                    et == NexsmEdgeType.Fictitious) {
                                e.removeUserDatum(userdatumkey + key);
                                _myGraph.removeEdge(e);
                            }
                        }
                    }
                }
View Full Code Here

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

       
        Vertex v = null;
        for (Object o: vertices) {
            if (o instanceof Vertex) {
                v = (Vertex)o;
                v.removeUserDatum("hostcomment");
            }
        }       
    }
   
    public void setVertex_HostComment(String host, StatHostComment hostcomment) {
View Full Code Here

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

       
        Vertex v = null;
        for (Object o: vertices) {
            if (o instanceof Vertex) {
                v = (Vertex)o;
                v.removeUserDatum("servicescomment");
            }
        }
    }
   
    public void setVertex_ServiceComment(String host, StatServiceComment servicecomment) {
View Full Code Here

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

   */
  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){
View Full Code Here

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

   */
  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){
View Full Code Here

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

   */
  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){
View Full Code Here

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

 
  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

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

   */
  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){
View Full Code Here

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

   */
  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){
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.