Package edu.uci.ics.jung.graph

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

155
156
157
158
159
160
161
162
163
164
165
166
167
      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();
View Full Code Here
67
68
69
70
71
72
73
74
75
76
  public static Collection<String> getAlphabetForEdges(Collection<Edge> edges){
    HashSet<String> alphabet = new HashSet<String>();
    Iterator<Edge> edgeIt = edges.iterator();
    while(edgeIt.hasNext()){
      Edge e = (edgeIt.next());
      alphabet.addAll((Collection<String>)e.getUserDatum(JUConstants.LABEL));
    }
    return alphabet;
  }
View Full Code Here
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
    Set<String>loopLabels = new HashSet<String>();
    boolean loopToR = r.getSuccessors().contains(r);
    boolean redAndBlueNeighbours = r.getNeighbors().contains(q);
    if(loopToR||redAndBlueNeighbours){ //there either exists a loop to r or will do if r and b merge
      if(loopToR){
        Edge e = findEdge(r, r);
        HashSet<String> labels = (HashSet<String>)e.getUserDatum(JUConstants.LABEL);
        loopLabels.addAll(labels);
      }
      if(redAndBlueNeighbours){
        Edge e = findEdge(r,q);
        HashSet<String> labels = (HashSet<String>)e.getUserDatum(JUConstants.LABEL);
        loopLabels.addAll(labels);
      }
    }
    wIt = w.iterator();
    while(wIt.hasNext()){
View Full Code Here
401
402
403
404
405
406
407
408
409
410
411
412
   */
  protected static HashSet<List<String>> getShortSuffixes(@SuppressWarnings("unused") DirectedSparseGraph g, Vertex v){
    HashSet<List<String>> returnStrings = new HashSet<List<String>>();
    Iterator<Edge> outEdgeIt = v.getOutEdges().iterator();
    while(outEdgeIt.hasNext()){
      Edge e = outEdgeIt.next();
      if(DeterministicDirectedSparseGraph.isAccept(e.getOpposite(v))){
        ArrayList<Edge> l = new ArrayList<Edge>();
        l.add(e);
        returnStrings.addAll(getPaths(l));
      }
    }
View Full Code Here
460
461
462
463
464
465
466
467
468
469
470
471
   * @return
   */
  protected static Set<List<String>> getPaths(List<Edge> l){
    TreeMap<Integer,Set<List<String>>> returnSet = new TreeMap<Integer,Set<List<String>>>();// KIRR: this should not be done in this way since access to this map is not random - you only need the last element in which case simply storing the last set of lists is best
    for(int i=0;i<l.size();i++){// for each element of the source list
      Edge e = l.get(i);
      Set<String> labels = (Set<String>)e.getUserDatum(JUConstants.LABEL);
      Set<List<String>> strings = new HashSet<List<String>>();
      for(String s:labels)
      {
        if(i==0){
          List<String> string = new ArrayList<String>();
View Full Code Here
496
497
498
499
500
501
502
503
504
505
506
507
    Vertex init = DeterministicDirectedSparseGraph.findInitial(model);
    UnweightedShortestPath p = new UnweightedShortestPath(model);
    Iterator<Edge> pathIt =  ShortestPathUtils.getPath(p, init, q).iterator();
    List<String> list = new ArrayList<String>();
    while(pathIt.hasNext()){
      Edge e = pathIt.next();
      Set<String> s = (Set<String>)e.getUserDatum(JUConstants.LABEL);
      Object[] strings = s.toArray();
      list.add(strings[0].toString());
    }
     
    return list;
View Full Code Here
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
      DirectedSparseEdge eDash = new DirectedSparseEdge(e.getSource(), qDash);
      eDash.addUserDatum(JUConstants.LABEL, e.getUserDatum(JUConstants.LABEL), UserData.CLONE);
      if(!e.getSource().getSuccessors().contains(qDash))
        model.addEdge(eDash);
      else{
        Edge existing = findEdge(e.getSource(), qDash);
        Set<String> labels = (Set<String>)existing.getUserDatum(JUConstants.LABEL);// KIRR: if you use UserData.SHARED, you do not need to copy the result back using put
        labels.addAll((Set<String>)e.getUserDatum(JUConstants.LABEL));
        existing.setUserDatum(JUConstants.LABEL, labels, UserData.CLONE);
      }
      removeEdges.add(e);
    }
    Iterator<DirectedSparseEdge> outEdges = q.getOutEdges().iterator();
    while(outEdges.hasNext()){
      DirectedSparseEdge e = outEdges.next();
      DirectedSparseEdge eDash = new DirectedSparseEdge(qDash, e.getDest());
      eDash.addUserDatum(JUConstants.LABEL, e.getUserDatum(JUConstants.LABEL), UserData.CLONE);
      if(!qDash.getSuccessors().contains(e.getDest()))
        model.addEdge(eDash);
      else{
        Edge existing = findEdge(qDash, e.getDest());
        Set<String> labels = (Set<String>)existing.getUserDatum(JUConstants.LABEL);
        labels.addAll((Set<String>)e.getUserDatum(JUConstants.LABEL));
        existing.setUserDatum(JUConstants.LABEL, labels, UserData.CLONE);
      }
      removeEdges.add(e);
    }
    model.removeEdges(removeEdges);
    model.removeVertex(q);
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
168
169
      prefixes = getPaths(prefixEdges);
    }
    Set<List<Label>> suffixes = computeSuffixes(tempRed, temp);
    List<List<Label>> questions =new LinkedList<List<Label>>();
    questions.addAll(mergePrefixWithSuffixes(prefixes, suffixes));
    Edge loopEdge = findEdge(tempRed, tempRed);
    if(loopEdge!=null){
      Collection<Label> looplabels = (Collection<Label>)loopEdge.getUserDatum(JUConstants.LABEL);
      questions.addAll(mergePrefixWithSuffixes(prefixes, looplabels,suffixes));
    }
   
    DirectedSparseGraph questionPrefixes = augmentPTA(DeterministicDirectedSparseGraph.initialise(), questions, true);
    Iterator<Vertex> questionIt = getEndPoints(questionPrefixes).iterator();
View Full Code Here
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
        Collection<String> existingLabels = (Collection<String>)e.getUserDatum(JUConstants.LABEL);
        g.removeEdge(e);

        // It is possible that there is already an edge between g.getSource Blue and newRed
        Iterator<DirectedSparseEdge> sourceOutIt = source.getOutEdges().iterator();
        Edge fromSourceToNewRed = null;
        while(sourceOutIt.hasNext() && fromSourceToNewRed == null)
        {
          DirectedSparseEdge out = sourceOutIt.next();if (out.getDest() == newRed) fromSourceToNewRed = out;
        }
        if (fromSourceToNewRed == null)
        {
          fromSourceToNewRed = new DirectedSparseEdge(source,newRed);
          fromSourceToNewRed.setUserDatum(JUConstants.LABEL, existingLabels, UserData.CLONE);// no need to clone this one since I'll delete the edge in a bit
          g.addEdge(fromSourceToNewRed);
        }
        else
          // there is already a transition from source to newRed, hence all we have to do is merge the new labels into it.
          ((Collection<String>)fromSourceToNewRed.getUserDatum(JUConstants.LABEL)).addAll( existingLabels );
         
      }

      // now the elements of mergedVertices are in terms of the copied graph.
      for(Vertex vert:(Set<Vertex>)g.getVertices())
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
    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);
    g.addEdge(e12);
    Edge e23 = new DirectedSparseEdge(v2, v3);
    e23.setUserDatum("ID", "23", UserData.SHARED);
    e23.setUserDatum("Name", "myEdge23", UserData.SHARED);
    e23.setUserDatum("Description", "myEdge 23 description", UserData.SHARED);
    e23.setUserDatum("Deepness", 1, UserData.SHARED);
    g.addEdge(e23);
    Edge e13 = new DirectedSparseEdge(v1, v3);
    e13.setUserDatum("ID", "13", UserData.SHARED);
    e13.setUserDatum("Name", "myEdge13", UserData.SHARED);
    e13.setUserDatum("Description", "myEdge 13 description", UserData.SHARED);
    e13.setUserDatum("Deepness", 1, UserData.SHARED);
    g.addEdge(e13);
    Edge e34= new DirectedSparseEdge(v3,v4);
    e34.setUserDatum("ID", "34", UserData.SHARED);
    e34.setUserDatum("Name", "myEdge34", UserData.SHARED);
    e34.setUserDatum("Description", "myEdge 34 description", UserData.SHARED);
    e34.setUserDatum("Deepness", 1, UserData.SHARED);
    g.addEdge(e34);
    return g;
  }
View Full Code Here
TOP

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

  • ca.nengo.ui.lib.util.ElasticLayout
  • com.neptuny.xgrapher.cli.test.SimpleGraphDraw
  • net.gridshield.nexsm.graphmanager.GraphManager
  • net.sf.sitstart.dao.impl.InMemorySiteGraphDAO
  • org.cishell.algorithm.convertergraph.ConverterGraphComputation
  • org.cishell.reference.service.conversion.DataConversionServiceImpl
  • statechum.analysis.Erlang.TestSynapseAuxiliaryFunctions
  • statechum.analysis.learning.computeStateScores
  • statechum.analysis.learning.linear.DifferenceVisualiser$ChangesToGraph
  • statechum.analysis.learning.RPNIBlueFringeLearnerOrig
    • 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.