Package edu.uci.ics.jung.graph

Examples of edu.uci.ics.jung.graph.Vertex

681
682
683
684
685
686
687
688
689
690
691
692
693
    if (value == null)
      throw new IllegalArgumentException("value to search for cannot be null");
   
    Iterator<Vertex> vertexIt = g.getVertices().iterator();
    while(vertexIt.hasNext()){
      Vertex v = vertexIt.next();
      if(v.getUserDatum(property) == null)
        continue;
      if(v.getUserDatum(property).equals(value))
        return v;
    }
    return null;
  }
View Full Code Here
698
699
700
701
702
703
704
705
706
707
708
   * @return initial vertex, null if not found.
   */
  public static Vertex findInitial(Graph g){
    Iterator<Vertex> vertexIt = g.getVertices().iterator();
    while(vertexIt.hasNext()){
      Vertex v = vertexIt.next();
      if (isInitial(v))
        return v;
    }
    return null;
  }
View Full Code Here
709
710
711
712
713
714
715
716
717
718
719
720
721
  public static Set<Vertex> findVertices(JUConstants property, Object value, Graph g){
    Set<Vertex> vertices = new HashSet<Vertex>();
    Iterator<Vertex> vertexIt = g.getVertices().iterator();
    while(vertexIt.hasNext()){
      Vertex v = vertexIt.next();
      if(v.getUserDatum(property) == null)
        continue;
      if(v.getUserDatum(property).equals(value))
        vertices.add(v);
    }
    return vertices;
  }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
        if (answer.firstElem == AbstractOracle.USER_CANCELLED)
        {
          System.out.println("CANCELLED");
          return null;
        }
        Vertex tempVertex = getVertex(temp, question);
        if(answer.firstElem == AbstractOracle.USER_ACCEPTED){
          sPlus.add(question);
         
          if(!DeterministicDirectedSparseGraph.isAccept(tempVertex))
          {
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
 
  public static Vertex getTempRed(DirectedSparseGraph model, Vertex r, DirectedSparseGraph temp){
    DijkstraShortestPath p = new DijkstraShortestPath(model);
    List<Edge> pathToRed = p.getPath(DeterministicDirectedSparseGraph.findInitial(model), r);
    Set<List<String>> pathToRedStrings = new HashSet<List<String>>();
    Vertex tempRed = null;
    if(!pathToRed.isEmpty()){
      pathToRedStrings = getPaths(pathToRed);
      List<String> prefixString = (List<String>)pathToRedStrings.toArray()[0];
      tempRed = getVertex(temp, prefixString);
    }
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
      tempRed = DeterministicDirectedSparseGraph.findInitial(temp);
    return tempRed;
  }
 
  protected List<List<String>> generateQuestions(DirectedSparseGraph model, DirectedSparseGraph temp, OrigStatePair pair){
    Vertex q = pair.getQ();
    Vertex r = pair.getR();
    if(q==null || r ==null)
      return new ArrayList<List<String>>();
    DijkstraShortestPath p = new DijkstraShortestPath(temp);
    Vertex tempRed = getTempRed(model, r, temp);
    Vertex tempInit = DeterministicDirectedSparseGraph.findInitial(temp);
    Set<List<String>> prefixes = new HashSet<List<String>>();
    if(!tempRed.equals(tempInit)){
      List<Edge> prefixEdges = p.getPath(tempInit, tempRed);
      prefixes = getPaths(prefixEdges);
    }
    Set<List<String>> suffixes = computeSuffixes(tempRed, temp);
    List<List<String>> questions =new ArrayList<List<String>>();
    questions.addAll(mergePrefixWithSuffixes(prefixes, suffixes));
    Edge loopEdge = findEdge(tempRed, tempRed);
    if(loopEdge!=null){
      Collection<String> looplabels = (Collection<String>)loopEdge.getUserDatum(JUConstants.LABEL);
      questions.addAll(mergePrefixWithSuffixes(prefixes, looplabels,suffixes));
    }
   
    DirectedSparseGraph questionPrefixes = augmentPTA(DeterministicDirectedSparseGraph.initialise(), questions, true);
    Iterator<Vertex> questionIt = getEndPoints(questionPrefixes).iterator();
    p = new DijkstraShortestPath(questionPrefixes);
    questions =new ArrayList<List<String>>();
    Vertex init = DeterministicDirectedSparseGraph.findInitial(questionPrefixes);
    while(questionIt.hasNext()){
      List<Edge> edgePath = p.getPath(init, questionIt.next());
      Set<List<String>> pathsToPoint = getPaths(edgePath);
      if(pathsToPoint.isEmpty())
        continue;
      List<String> pathToPoint = (List<String>)getPaths(edgePath).toArray()[0];
      Vertex tempV = getVertex(temp, pathToPoint);
      Vertex v = getVertex(model, pathToPoint);
      if(v == null)
        questions.add(pathToPoint);
      else if(Test_Orig_RPNIBlueFringeLearner.different(new OrigStatePair(v, tempV)))
        questions.add(pathToPoint);
     
View Full Code Here
269
270
271
272
273
274
275
276
277
278
279
 
  private static Set<Vertex> getEndPoints(DirectedSparseGraph g){
    Set<Vertex> returnSet = new HashSet<Vertex>();
    Iterator<Vertex> vertexIt = g.getVertices().iterator();
    while(vertexIt.hasNext()){
      Vertex v = vertexIt.next();
      if(v.getSuccessors().isEmpty())
        returnSet.add(v);
    }
    return returnSet;
  }
View Full Code Here
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
      if (!(vertToClone instanceof Vertex))
        throw new IllegalArgumentException("Cannot clone vertex which is neither a CmpVertex nor Vertex, what was passed is "+vertToClone);
      if (!conf.isAllowedToCloneNonCmpVertex())
        throw new IllegalArgumentException("Cannot clone a non-CmpVertex - prohibited using configuration");
     
      Vertex srcVert = (Vertex)vertToClone;
      if (!srcVert.containsUserDatumKey(JUConstants.LABEL))
        throw new IllegalArgumentException("vertex "+srcVert+" is not labelled");
     
      // Copying the attributes associated with the vertex
      Object label = srcVert.getUserDatum(JUConstants.LABEL);
      if (label instanceof VertexID)
        result = generateNewCmpVertex((VertexID)label, conf);
      else
        if (label instanceof String)
          result = generateNewCmpVertex(VertexID.parseID((String)label), conf);
        else
          throw new IllegalArgumentException("vertex with label "+label+" has an unsupported type");

      result.setAccept(DeterministicDirectedSparseGraph.isAccept(srcVert));
      if (srcVert.containsUserDatumKey(JUConstants.COLOUR))
        result.setColour((JUConstants)srcVert.getUserDatum(JUConstants.COLOUR));
      if (srcVert.containsUserDatumKey(JUConstants.HIGHLIGHT))
        result.setHighlight(true);
      if (srcVert.containsUserDatumKey(JUConstants.ORIGSTATE))
        result.setOrigState((VertexID)srcVert.getUserDatum(JUConstants.ORIGSTATE));
      if (srcVert.containsUserDatumKey(JUConstants.DEPTH))
        result.setDepth((Integer)srcVert.getUserDatum(JUConstants.DEPTH));
    }
    return result;
  }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
  protected Graph removeNegatives(Graph g){
    Iterator<Vertex> vertexIt = g.getVertices().iterator();
    HashSet<Vertex> remove = new HashSet<Vertex>();
    while(vertexIt.hasNext()){
      Vertex v = vertexIt.next();
      if(!DeterministicDirectedSparseGraph.isAccept(v)&&!DeterministicDirectedSparseGraph.isInitial(v))
        remove.add(v);
    }
    Iterator<Vertex> removeIt = remove.iterator();
    while(removeIt.hasNext()){
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
    for(Vertex v: DeterministicDirectedSparseGraph.findVertices(JUConstants.COLOUR, JUConstants.RED, model))
    {
      Iterator<DirectedSparseEdge>neighbourIt = v.getOutEdges().iterator();
      while(neighbourIt.hasNext()){
        DirectedSparseEdge next = neighbourIt.next();
        Vertex neighbour = next.getDest();
        JUConstants neighbourColour = (JUConstants)neighbour.getUserDatum(JUConstants.COLOUR);
        if(neighbourColour!=null){
          if(neighbourColour == JUConstants.RED)
            continue;
        }
        neighbour.setUserDatum(JUConstants.COLOUR, JUConstants.BLUE, UserData.SHARED);
        blues.add(neighbour);
       
      }
    }
    //updateGraph(model);
View Full Code Here
TOP

Related Classes of edu.uci.ics.jung.graph.Vertex

  • ca.nengo.ui.lib.util.ElasticLayout
  • ca.nengo.ui.lib.world.elastic.FeedForwardLayout
  • ca.nengo.ui.lib.world.elastic.StretchedFeedForwardLayout
  • com.neptuny.xgrapher.cli.controller.XGrapherMouseListener
  • com.neptuny.xgrapher.cli.mapping.DefaultMapping
  • net.gridshield.nexsm.graphmanager.BallonLayout2
  • net.gridshield.nexsm.graphmanager.BaloonLayout
  • net.gridshield.nexsm.graphmanager.GraphManager
  • net.gridshield.nexsm.graphmanager.NexsmInfoGraphMousePlugin
  • net.gridshield.nexsm.graphmanager.NexsmInfoGraphMousePlugin_1
    • Copyright © 2018 www.massapicom. 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.