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

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

186
187
188
189
190
191
192
193
194
195
    return false;
  }

  static protected PairScore constructPairScore(String a,String b, int score)
  {
    DirectedSparseVertex aV = new DirectedSparseVertex(), bV = new DirectedSparseVertex();
    aV.addUserDatum(JUConstants.LABEL, a, UserData.SHARED);
    bV.addUserDatum(JUConstants.LABEL, b, UserData.SHARED);
    return new computeStateScores.PairScore(aV,bV, score,score);
  }
View Full Code Here
341
342
343
344
345
346
347
348
349
  public final void testComputePathsToRed0a()
  {
    computeStateScores s = new computeStateScores(TestFSMAlgo.buildGraph("A-a->B-b->C-a->A\n", "testComputePathsToRed1"),"SINK");
    Set<List<String>> expected = buildSet(new String[][] {
      }),
      actual = new HashSet<List<String>>();actual.addAll(s.computePathsToRed(new DirectedSparseVertex()));
     
    Assert.assertTrue("expected: "+expected+", actual: "+actual, expected.equals(actual));
  }
View Full Code Here
412
413
414
415
416
417
418
  }
 
  @Test(expected = IllegalArgumentException.class)
  public final void testLearnerFailsWhenRedNotFound()
  {
    new computeStateScores(0).computeQS(new StatePair(null,new DirectedSparseVertex()), new computeStateScores(0));
  }
View Full Code Here
719
720
721
722
723
724
725
726
727
728
 
  @Test
  public final void testCopyGraph0()
  {
    DirectedSparseGraph g=new DirectedSparseGraph();
    g.addVertex(new DirectedSparseVertex());
    g.addVertex(new DirectedSparseVertex());
    DirectedSparseGraph copy = computeStateScores.copy(g);
    Assert.assertTrue(copy.getEdges().isEmpty() && copy.getVertices().isEmpty());
  }
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
148
149
150
 
  @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 enVerySmall = new PTA_FSMStructure(new LearnerGraph(g,mainConfiguration),null);
    vertifyPTA(enVerySmall, 1, new String[][] {
        new String[] {}
      });
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
163
164
165
  @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 enVerySmall = new PTA_FSMStructure(new LearnerGraph(g,mainConfiguration),null);
    vertifyPTA(enVerySmall, 1, new String[][] {
        new String[] {}
    });
View Full Code Here
975
976
977
978
979
980
981
982
983
984
985
986
987
988
   */
  @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,mainConfiguration);
    en = new PTA_FSMStructure(machine,null) {
      {
        init(machine.new FSMImplementation(){
View Full Code Here
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
  /** 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,mainConfiguration),null);
    engine.containsSequence(new ArrayList<Label>());
  }
View Full Code Here
841
842
843
844
845
846
847
848
849
850
851
852
853
  }

  /** Creates a graph with a single accept-vertex. */
  public static DirectedSparseGraph initialise(){
    DirectedSparseGraph pta = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);
    pta.setUserDatum(JUConstants.TITLE, "Hypothesis machine", UserData.SHARED);
    pta.addVertex(init);
    DeterministicDirectedSparseGraph.numberVertices(pta);
    return pta;
  }
View Full Code Here
862
863
864
865
866
867
868
869
870
871
872
873
874
875
   * @return true if any transitions have been added
   */  
  @SuppressWarnings("unchecked")
  public static boolean completeGraph(DirectedSparseGraph g, String reject)
  {
    DirectedSparseVertex rejectVertex = new DirectedSparseVertex();
    boolean transitionsToBeAdded = false;// whether and new transitions have to be added.
    rejectVertex.addUserDatum(JUConstants.ACCEPTED, false, UserData.SHARED);
    rejectVertex.addUserDatum(JUConstants.LABEL, reject, UserData.SHARED);
   
    // first pass - computing an alphabet
    Set<Label> alphabet = computeAlphabet(g);
   
    // second pass - checking if any transitions need to be added.
View Full Code Here
TOP

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

  • com.neptuny.xgrapher.cli.mapping.DefaultMapping
  • com.neptuny.xgrapher.cli.test.SimpleGraphDraw
  • net.gridshield.nexsm.mapper.Mapper
  • net.sf.sitstart.dao.impl.InMemorySiteGraphDAO
  • org.cishell.algorithm.convertergraph.ConverterGraphComputation
  • org.wymiwyg.knobot.visualization.TopicGraph
  • statechum.analysis.learning.RPNIBlueFringeLearnerOrig
  • statechum.analysis.learning.rpnicore.TestEqualityComparisonAndHashCode
  • statechum.analysis.learning.rpnicore.TestGraphConstruction
  • statechum.analysis.learning.rpnicore.TestGraphConstructionWithDifferentConf
    • 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.