Package statechum.DeterministicDirectedSparseGraph

Examples of statechum.DeterministicDirectedSparseGraph.VertexID

485
486
487
488
489
490
491
492
493
494
495
496
  }
 
  @Test
  public void testVertexIDLess1()
  {
    VertexID pA=new VertexID(VertKind.POSITIVE,5), pB=new VertexID(idP5),
      qA = new VertexID(VertKind.POSITIVE,6);
    checkLessHelper(pA,qA);
    checkLessHelper(pB,qA);// now qA has a cached representation of its string value.
    checkLessHelper(pB,qA);
    checkLessHelper(pA,qA);
  }
View Full Code Here
496
497
498
499
500
501
502
503
504
505
506
507
  }
 
  @Test
  public void testVertexIDLess2()
  {
    VertexID pA=new VertexID(idP5), pB=new VertexID(VertKind.POSITIVE,5),
      qA = new VertexID(idP6);
    checkLessHelper(pA,qA);
    checkLessHelper(pB,qA);// now pB has a cached representation of its string value.
    checkLessHelper(pB,qA);
    checkLessHelper(pA,qA);
  }
View Full Code Here
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
  }
 
  @Test
  public void testVertexIDLess3()
  {
    VertexID pA=new VertexID(VertKind.POSITIVE,5), pB=new VertexID(VertKind.POSITIVE,10),
      qA = new VertexID(VertKind.POSITIVE,6);
    checkLessHelper(pA,qA);
    checkLessHelper(pA,pB);
    checkLessHelper(qA,pB);
   
    Assert.assertTrue("P10".compareTo("P5") < 0);
   
    Assert.assertTrue(pB.compareTo(new VertexID(idP5)) > 0);
   
    checkLessHelper(pA,qA);
    checkLessHelper(pA,pB);
    checkLessHelper(qA,pB);
  }
View Full Code Here
1275
1276
1277
1278
1279
1280
1281
1282
    Assert.assertEquals(expected, new LearnerGraph(g,config).wmethod.computeAlphabet());
    Assert.assertEquals(expected, DeterministicDirectedSparseGraph.computeAlphabet(g));       

    LearnerGraph clone = new LearnerGraph(g,config).copy(config);
    Assert.assertFalse( clone.paths.completeGraph(
        new VertexID("REJECT")));
    Assert.assertFalse(DeterministicDirectedSparseGraph.completeGraph(g,"REJECT"));
  }
View Full Code Here
1294
1295
1296
1297
1298
1299
1300
1301
  {
    DirectedSparseGraph g = buildGraph(originalGraph, testName);
    Assert.assertEquals(whetherToBeCompleted,DeterministicDirectedSparseGraph.completeGraph(g,"REJECT"));checkM(g, expectedOutcome,config);   
    LearnerGraph fsm = new LearnerGraph(buildGraph(originalGraph, testName),config);
    Assert.assertEquals(whetherToBeCompleted,fsm.paths.completeGraph(
        new VertexID("REJECT")));
    WMethod.checkM(fsm, new LearnerGraph(buildGraph(expectedOutcome,testName),config));       
  }
View Full Code Here
1303
1304
1305
1306
1307
1308
1309
  /** Checks that passing a name of an existing state causes an exception to be thrown. */
  @Test(expected=IllegalArgumentException.class)
  public void complete_fail()
  {
    new LearnerGraph(buildGraph("A-a->A-b->B-c->B", "complete_fail"),config).paths.completeGraph(
        new VertexID("B"));
  }
View Full Code Here
1407
1408
1409
1410
1411
1412
1413
  @Test
  public void testFindVertex4b()
  {
    Vertex v =  DeterministicDirectedSparseGraph.findVertex(JUConstants.INITIAL, true, buildGraph("A-a->A-b->B-c->B-a->C\nQ-d->S", "testFindVertex4b"));
    Assert.assertEquals(new VertexID("A"), v.getUserDatum(JUConstants.LABEL));
  }
View Full Code Here
1413
1414
1415
1416
1417
1418
1419
1420
  }

  @Test
  public void testFindVertex5()
  {
    Vertex v =  DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, new VertexID("A"), buildGraph("A-a->A-b->B-c->B-a->C\nQ-d->S", "testFindVertex5"));
    Assert.assertEquals(new VertexID("A"), v.getUserDatum(JUConstants.LABEL));
  }
View Full Code Here
1420
1421
1422
1423
1424
1425
1426
1427
  }
 
  @Test
  public void testFindVertex6()
  {
    Vertex v =  DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, new VertexID("C"), buildGraph("A-a->A-b->B-c->B-a->C\nQ-d->S", "testFindVertex6"));
    Assert.assertEquals(new VertexID("C"), v.getUserDatum(JUConstants.LABEL));
  }
View Full Code Here
1427
1428
1429
1430
1431
1432
1433
1434
  }
 
  @Test
  public void testFindVertex7()
  {
    Vertex v = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, new VertexID("S"), buildGraph("A-a->A-b->B-c->B-a->C\nQ-d->S", "testFindVertex7"));
    Assert.assertEquals(new VertexID("S"), v.getUserDatum(JUConstants.LABEL));
  }
View Full Code Here
TOP

Related Classes of statechum.DeterministicDirectedSparseGraph.VertexID

  • collections.TestMapWithSearch
  • statechum.analysis.learning.experiments.ExperimentGraphMLHandler
  • statechum.analysis.learning.experiments.ForestFireNDStateMachineGenerator
  • statechum.analysis.learning.experiments.ForestFireStateMachineGenerator
  • statechum.analysis.learning.experiments.mutation.GraphMutator
  • statechum.analysis.learning.linear.GD
  • statechum.analysis.learning.linear.GD$DCollector
  • statechum.analysis.learning.linear.GD$LearnerGraphMutator
  • statechum.analysis.learning.linear.TestGD_Multithreaded
  • statechum.analysis.learning.linear.TestLinear
    • 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.