Package edu.uci.ics.jung.graph.impl

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
  }
 
  @Test
  public final void testGetData_Empty1()
  {
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, false, UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    PTASequenceEngine engine = new PTA_FSMStructure(new LearnerGraph(g,config));
    vertifyPTA(engine, 1, new String[][] {
        new String[] {}
      });
  }
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
  }

  @Test
  public final void testGetData_Empty2()
  {
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true,UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    PTASequenceEngine engine = new PTA_FSMStructure(new LearnerGraph(g,config));
    vertifyPTA(engine, 1, new String[][] {
        new String[] {}
    });
  }
View Full Code Here
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
   * only one state in the graph which is negative, the outcome is zero.
   */
  @Test
  public final void test_sequenceSet_testing_shouldBeReturned4()
  {
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, false, UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    final LearnerGraph machine = new LearnerGraph(g,config);
    en = new PTA_FSMStructure(machine) {
      {
        init(machine.new FSMImplementation(){
          @Override
View Full Code Here
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
  /** Tests that we choke on an empty graph. */
  @Test(expected=IllegalArgumentException.class)
  public final void test_containsSequence1_fail()
  {
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, false, UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    PTASequenceEngine engine = new PTA_FSMStructure(new LearnerGraph(g,config));
    engine.containsSequence(new ArrayList<String>());
  }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
 
  @Override
  public LearnerGraph learnMachine(Collection<List<String>> argSPlus, Collection<List<String>> argSMinus)   {
    this.sPlus = argSPlus;
    this.sMinus = argSMinus;
    DirectedSparseGraph model = createAugmentedPTA(sPlus, sMinus);// KIRR: node labelling is done by createAugmentedPTA
    DeterministicDirectedSparseGraph.findInitial(model).setUserDatum(JUConstants.COLOUR, JUConstants.RED, UserData.SHARED);
    setChanged();

    Stack<OrigStatePair> possibleMerges = chooseStatePairs(model, sPlus, sMinus);
    while(!possibleMerges.isEmpty()){
      OrigStatePair pair = possibleMerges.pop();
      DirectedSparseGraph temp = mergeAndDeterminize(model, pair);
      pair.getQ().setUserDatum(JUConstants.HIGHLIGHT, pair, UserData.SHARED);
      pair.getR().setUserDatum(JUConstants.HIGHLIGHT, pair, UserData.SHARED);// since this copy of the graph will really not be used, changes to it are immaterial at this stage
      setChanged();
      List<List<String>> questions = new ArrayList<List<String>>();
      doneEdges = new HashSet<DirectedSparseEdge>();
View Full Code Here
161
162
163
164
165
166
167
168
169
170
171
    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()){
View Full Code Here
187
188
189
190
191
192
193
194
195
196
197
  public static DirectedSparseGraph mergeAndDeterminize(Graph model, OrigStatePair pair){
    Graph original = (Graph)model.copy();
    Vertex q = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, pair.getQ().getUserDatum(JUConstants.LABEL),original);
    Vertex qDash = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, pair.getR().getUserDatum(JUConstants.LABEL),original);
   
    DirectedSparseGraph temp = merge((DirectedSparseGraph)original, new OrigStatePair(q,qDash));
    OrigStatePair mergable = findMergablePair(temp);
    while(mergable!=null){
      temp=merge(temp, mergable);
      mergable = findMergablePair(temp);
    }
View Full Code Here
197
198
199
200
201
202
203
204
205
206
207
    }
    return temp;
  }
 
  protected static DirectedSparseGraph createAugmentedPTA(Collection<List<String>> plus, Collection<List<String>> minus){
    DirectedSparseGraph model = DeterministicDirectedSparseGraph.initialise();
    model = augmentPTA(model, minus, false);
    model = augmentPTA(model, plus, true);
    DeterministicDirectedSparseGraph.numberVertices(model);
    return model;
  }
View Full Code Here
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
  /** This one is a very old implementation of the learner, kept for some regression testing
   * but not participating in the logging-and-comparing type of testing.
   */
  @Override
  public LearnerGraph learnMachine(@SuppressWarnings("unused") Collection<List<String>> plus, @SuppressWarnings("unused") Collection<List<String>> minus) {
    DirectedSparseGraph model = init(sPlus, sMinus).pathroutines.getGraph();
   
    Vertex init = DeterministicDirectedSparseGraph.findInitial(model);
    init.setUserDatum(JUConstants.COLOUR, JUConstants.RED, UserData.SHARED);

    Stack<OrigStatePair> possibleMerges = chooseStatePairs(model, sPlus, sMinus);
    while(!possibleMerges.isEmpty()){
      OrigStatePair pair = possibleMerges.pop();

      DirectedSparseGraph temp = mergeAndDeterminize((Graph)model.copy(), pair);
      if(compatible(temp, sPlus, sMinus)){// KIRR: this should always return true
        pair.getQ().setUserDatum(JUConstants.HIGHLIGHT, pair, UserData.SHARED);
        pair.getR().setUserDatum(JUConstants.HIGHLIGHT, pair, UserData.SHARED);
        setChanged();
        List<List<String>> questions;
View Full Code Here
598
599
600
601
602
603
604
605
606
607
608
      while(!redStack.isEmpty()){
        Vertex redVertex = redStack.pop();
        OrigStatePair pair = new OrigStatePair(blueVertex, redVertex);
        doneEdges = new HashSet<DirectedSparseEdge>();
        Integer score = new Integer(computeScore(g,pair));
        DirectedSparseGraph temp = mergeAndDeterminize((Graph)g.copy(), pair);
        if(compatible(temp, sPlus, sMinus)){
          // singleSet maps scores to pairs which have those scores
          if(score<config.getKlimit())
            continue;
          if(singleSet.get(score) == null){
View Full Code Here
TOP

Related Classes of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

  • com.neptuny.xgrapher.cli.mapping.DefaultMapping
  • com.neptuny.xgrapher.cli.test.SimpleGraphDraw
  • net.gridshield.nexsm.graphmanager.GraphManager
  • org.cishell.algorithm.convertergraph.ConverterGraphComputation
  • org.cishell.reference.service.conversion.DataConversionServiceImpl
  • org.wymiwyg.knobot.visualization.TopicGraph
  • statechum.analysis.Erlang.Synapse$StatechumProcess
  • statechum.analysis.Erlang.TestSynapseAuxiliaryFunctions
  • statechum.analysis.learning.CheckComputeQuestions
  • statechum.analysis.learning.computeStateScores
    • 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.