Package statechum.DeterministicDirectedSparseGraph

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

778
779
780
781
782
783
784
785
786
787
788
789
790
 
  /** Handling of depth using representatives where multiple equivalence classes are merged. */
  @Test
  public final void testEqClassRepresentatives6() throws IncompatibleStatesException
  {
    CmpVertex A = new StringVertex("A"), B = new StringVertex("B"), C=new DeterministicVertex("C"), D=new DeterministicVertex("D"),
      E = new DeterministicVertex("E");
    B.setDepth(5);C.setDepth(45);D.setDepth(4);E.setDepth(4);
    AMEquivalenceClass<CmpVertex,LearnerGraphCachedData>
      eqClassA = buildClass(new AMEquivalenceClass<CmpVertex,LearnerGraphCachedData>(0,testGraphString),
          new CmpVertex[]{A,B}),
      eqClassB = buildClass(new AMEquivalenceClass<CmpVertex,LearnerGraphCachedData>(0,testGraphString),
          new CmpVertex[]{C,D}),eqClassC = buildClass(new AMEquivalenceClass<CmpVertex,LearnerGraphCachedData>(0,testGraphString),new CmpVertex[]{E});
View Full Code Here
794
795
796
797
798
799
800
801
802
803
804
805
 
  /** Testing whether checking for incompatible vertices works correctly. */
  @Test
  public final void testIncompatChecking1()
  {
    CmpVertex A = new StringVertex("A"), B = new StringVertex("B"), C=new DeterministicVertex("C");
    C.setAccept(false);
    PairCompatibility<CmpVertex> incompatibles = new PairCompatibility<CmpVertex>(HashMapWithSearch.DEFAULT_INITIAL_CAPACITY);
    Assert.assertTrue(AbstractLearnerGraph.checkCompatible(A, B, incompatibles));
    Assert.assertTrue(AbstractLearnerGraph.checkCompatible(B, A, incompatibles));
    Assert.assertTrue(AbstractLearnerGraph.checkCompatible(A, A, incompatibles));
    Assert.assertTrue(AbstractLearnerGraph.checkCompatible(B, B, incompatibles));
View Full Code Here
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
  @Test
  public final void testStatePairEquality()
  {
    final Object samePairs[] = new StatePair[]{
        new StatePair(new StringVertex("a"), new StringVertex("b")),
        new StatePair(new DeterministicVertex("a"), new StringVertex("b")),
        new StatePair(new StringVertex("a"), new DeterministicVertex("b")),
        new StatePair(new DeterministicVertex("a"), new DeterministicVertex("b"))       
    },
    differentPairs[] = new Object[] {
        new StatePair(new StringVertex("a"), new StringVertex("c")),
        new StatePair(new StringVertex("d"), new StringVertex("b")),
        new StatePair(new StringVertex("d"), new StringVertex("e")),
View Full Code Here
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
  /** Tests that nulls are valid elements of state pairs. */
  public final void testStatePairEqualityWithNulls1()
  {
    final Object samePairs[] = new StatePair[]{
        new StatePair(null, new StringVertex("b")),
        new StatePair(null, new DeterministicVertex("b"))     
    },
    differentPairs[] = new Object[] {
        new StatePair(new StringVertex("b"), new StringVertex("b")),
        new StatePair(new DeterministicVertex("b"), new StringVertex("b")),
        new StatePair(null, null),
        constructOrigPair("a", "b")
    };
    for(int sameFirst=0;sameFirst<samePairs.length;++sameFirst)
      for(int sameSecond=0;sameSecond<samePairs.length;++sameSecond)
View Full Code Here
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
  /** Tests that nulls are valid elements of state pairs. */
  public final void testStatePairEqualityWithNulls2()
  {
    final Object samePairs[] = new StatePair[]{
        new StatePair(new StringVertex("b"), null),
        new StatePair(new DeterministicVertex("b"),null)
    },
    differentPairs[] = new Object[] {
        new StatePair(new StringVertex("b"), new StringVertex("b")),
        new StatePair(new DeterministicVertex("b"), new StringVertex("b")),
        new StatePair(null, null),
        constructOrigPair("a", "b")
    };
    for(int sameFirst=0;sameFirst<samePairs.length;++sameFirst)
      for(int sameSecond=0;sameSecond<samePairs.length;++sameSecond)
View Full Code Here
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
    final Object samePairs[] = new StatePair[]{
        new StatePair(null, null)
    },
    differentPairs[] = new Object[] {
        new StatePair(null, new StringVertex("b")),
        new StatePair(new DeterministicVertex("b"), null),
        constructOrigPair("a", "b")
    };
    for(int sameFirst=0;sameFirst<samePairs.length;++sameFirst)
      for(int sameSecond=0;sameSecond<samePairs.length;++sameSecond)
        for(int different=0;different<differentPairs.length;++different)
View Full Code Here
1578
1579
1580
1581
1582
1583
1584
1585
  }
 
  private final static void checkLess(String a,String b,String c,String d)
  {
    checkLessHelper(new StatePair(new StringVertex(a), new StringVertex(b)), new StatePair(new StringVertex(c), new StringVertex(d)));
    checkLessHelper(new StatePair(new DeterministicVertex(a), new StringVertex(b)), new StatePair(new DeterministicVertex(c), new StringVertex(d)));
    checkLessHelper(new StatePair(new StringVertex(a), new DeterministicVertex(b)), new StatePair(new StringVertex(c), new DeterministicVertex(d)));
  }
View Full Code Here
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
  /** Checking that attributes which are cleared are not added to a Jung vertex. */
  @Test
  public final void testVertexConstruction()
  {
    Configuration conf = Configuration.getDefaultConfiguration().copy();conf.setAllowedToCloneNonCmpVertex(true);
    DeterministicVertex vertex = new DeterministicVertex("testVertex");
    vertex.setAccept(false);vertex.setHighlight(true);vertex.setColour(JUConstants.AMBER);vertex.setOrigState(VertexID.parseID("id"));vertex.setDepth(34);
    Assert.assertTrue(vertex.containsUserDatumKey(JUConstants.LABEL));
    Assert.assertTrue(vertex.containsUserDatumKey(JUConstants.ACCEPTED));
    Assert.assertTrue(vertex.containsUserDatumKey(JUConstants.HIGHLIGHT));
    Assert.assertTrue(vertex.containsUserDatumKey(JUConstants.COLOUR));
    Assert.assertTrue(vertex.containsUserDatumKey(JUConstants.ORIGSTATE));
    Assert.assertTrue(vertex.containsUserDatumKey(JUConstants.DEPTH));
   
    vertex.setAccept(true);vertex.setHighlight(false);vertex.setColour(null);vertex.setOrigState(null);vertex.setDepth(JUConstants.intUNKNOWN);
    Assert.assertTrue(vertex.containsUserDatumKey(JUConstants.LABEL));
    Assert.assertTrue(vertex.containsUserDatumKey(JUConstants.ACCEPTED));
    Assert.assertFalse(vertex.containsUserDatumKey(JUConstants.HIGHLIGHT));
    Assert.assertFalse(vertex.containsUserDatumKey(JUConstants.COLOUR));
    Assert.assertFalse(vertex.containsUserDatumKey(JUConstants.ORIGSTATE));
    Assert.assertFalse(vertex.containsUserDatumKey(JUConstants.DEPTH));
  }
View Full Code Here
158
159
160
161
162
163
164
165
166
167
168
  }

  @Test
  public void testAddEdge1()
  {
    DeterministicVertex vA = (DeterministicVertex) DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL,VertexID.parseID("C"),gen.machine),
    vB = (DeterministicVertex) DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL,VertexID.parseID("B"),gen.machine);

    LearnerGraph outcome = new LearnerGraph(gen.machine,Configuration.getDefaultConfiguration());
    Assert.assertEquals(0,outcome.getTransitionMatrix().get(outcome.findVertex(VertexID.parseID("C"))).size());
    Assert.assertTrue(gen.addEdgeInternal(vA, vB));// this adds a numeric label
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
 
  /** Parallel edge. */
  @Test
  public void testAddEdge2()
  {
    DeterministicVertex vA = (DeterministicVertex) DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL,VertexID.parseID("A"),gen.machine),
    vB = (DeterministicVertex) DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL,VertexID.parseID("B"),gen.machine);

    LearnerGraph outcome = new LearnerGraph(gen.machine,Configuration.getDefaultConfiguration());
    Assert.assertEquals(2,outcome.getTransitionMatrix().get(outcome.findVertex(VertexID.parseID("A"))).size());
    Assert.assertTrue(gen.addEdgeInternal(vA, vB));// this adds a numeric label
View Full Code Here
TOP

Related Classes of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  • statechum.analysis.learning.experiments.ForestFireStateMachineGenerator
  • statechum.analysis.learning.experiments.TestForestFireGenerator
  • statechum.analysis.learning.linear.DifferenceVisualiser$ChangesToGraph
  • statechum.analysis.learning.rpnicore.AbstractLearnerGraph
  • statechum.analysis.learning.rpnicore.AbstractPathRoutines
  • statechum.analysis.learning.rpnicore.FsmParser
  • statechum.analysis.learning.rpnicore.LearnerGraph
  • statechum.analysis.learning.rpnicore.MergeStates
  • statechum.analysis.learning.rpnicore.PathRoutines
  • statechum.analysis.learning.rpnicore.TestEqualityComparisonAndHashCode
    • 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.