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

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph.addVertex()

135
136
137
138
139
140
141
142
143
144
145
            toVertex = new DeterministicDirectedSparseGraph.DeterministicVertex();
            toVertex.removeUserDatum(JUConstants.ACCEPTED); // in case we've got a reject loop in the same state
            toVertex.addUserDatum(JUConstants.ACCEPTED, Boolean.toString(accept), UserData.SHARED);
            toVertex.addUserDatum(JUConstants.LABEL, to, UserData.SHARED);
            existingVertices.put(to, toVertex);
            g.addVertex(toVertex);
          }
          else
            if (Boolean.valueOf(toVertex.getUserDatum(JUConstants.ACCEPTED).toString()) != accept)
              throw new IllegalArgumentException("conflicting acceptance assignment on vertex "+to);
       
View Full Code Here
596
597
598
599
600
601
602
603
604
605
606
  /** Checks if adding a vertex to a graph causes an exception to be thrown. */
  public static void checkWithVertex(Vertex v,String expectedExceptionString, String testName)
  {
    final DirectedSparseGraph g = buildGraph("A--a-->B<-b-CONFL\nA-b->A-c->A\nB-d->B-p->CONFL",testName);
    getGraphData(g);// without the vertex being added, everything should be fine.
    g.addVertex(v);// add the vertex
   
    boolean exceptionThrown = false;
    try
    {
      getGraphData(g);// now getGraphData should choke.     
View Full Code Here
667
668
669
670
671
672
673
674
675
676
677
  public final void testGraphConstructionFail7() // unlabelled states
  {
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.PROPERTY, JUConstants.INIT, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, "true", UserData.SHARED);g.addVertex(init);
    boolean exceptionThrown = false;
    try
    {
      getGraphData(g);// now getGraphData should choke.     
    }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum("property", "init", UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, "false", UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    PTATestSequenceEngine enVerySmall = new PTA_FSMStructure(WMethod.getGraphData(g));
    vertifyPTA(enVerySmall, new String[][] {
        new String[] {}
      });
  }
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum("property", "init", UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, "true", UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    PTATestSequenceEngine enVerySmall = new PTA_FSMStructure(WMethod.getGraphData(g));
    vertifyPTA(enVerySmall, new String[][] {
        new String[] {}
    });
  }
View Full Code Here
328
329
330
331
332
333
334
335
336
337
338
  public void checkWithVertex(Vertex v,String expectedExceptionString, String testName)
  {
    LearnerGraph graph = buildLearnerGraph("A--a-->B<-b-CNFL\nA-b->A-c->A\nB-d->B-p->CNFL",testName,config,converter);
    final DirectedSparseGraph g = graph.pathroutines.getGraph();
    new LearnerGraph(g,config);// without the vertex being added, everything should be fine.
    g.addVertex(v);// add the vertex

    checkForCorrectException(new whatToRun() { public @Override void run() {
      new LearnerGraph(g,config);// now getGraphData should choke.
    }},IllegalArgumentException.class,expectedExceptionString);
  }
View Full Code Here
464
465
466
467
468
469
470
471
472
473
474
  @Test
  public final void testCopyGraph0()
  {
    DirectedSparseGraph g=new DirectedSparseGraph();
    g.addVertex(new DirectedSparseVertex());
    g.addVertex(new DirectedSparseVertex());
    DirectedSparseGraph copy = DeterministicDirectedSparseGraph.copy(g);
    Assert.assertTrue(copy.getEdges().isEmpty() && copy.getVertices().isEmpty());
  }
 
View Full Code Here
465
466
467
468
469
470
471
472
473
474
475
  @Test
  public final void testCopyGraph0()
  {
    DirectedSparseGraph g=new DirectedSparseGraph();
    g.addVertex(new DirectedSparseVertex());
    g.addVertex(new DirectedSparseVertex());
    DirectedSparseGraph copy = DeterministicDirectedSparseGraph.copy(g);
    Assert.assertTrue(copy.getEdges().isEmpty() && copy.getVertices().isEmpty());
  }
 
  /** Yet another test that copy works. */
 
View Full Code Here
211
212
213
214
215
216
217
218
219
220
221
  /** Checks if adding a vertex to a graph causes an exception to be thrown. */
  public void checkWithVertex(Vertex v,String expectedExceptionString, String testName)
  {
    final DirectedSparseGraph g = buildGraph("A--a-->B<-b-CONFL\nA-b->A-c->A\nB-d->B-p->CONFL",testName);
    new LearnerGraph(g,config);// without the vertex being added, everything should be fine.
    g.addVertex(v);// add the vertex
   
    try
    {
      new LearnerGraph(g,config);// now getGraphData should choke.
      Assert.fail("exception not thrown");
View Full Code Here
299
300
301
302
303
304
305
306
307
308
309
  public final void testGraphConstructionFail7()
  {
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);g.addVertex(init);
    boolean exceptionThrown = false;
    try
    {
      new LearnerGraph(new DirectedSparseGraph(),config);// now getGraphData should choke.     
    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.