Package org.graphstream.graph.implementations

Examples of org.graphstream.graph.implementations.SingleGraph

34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
*/
public class ExampleJSONSender {

    public static void main(String args[]) {

  Graph graph = new SingleGraph("Tutorial 1");

  Viewer viewer = graph.display();

  JSONSender sender = new JSONSender("localhost", 8080, "workspace0");
  sender.setDebug(true);
  graph.addSink(sender);

  graph.addNode("A");
  graph.addNode("B");
  graph.addNode("C");
  sleep();
  graph.addEdge("AB", "A", "B");
  graph.addEdge("BC", "B", "C");
  graph.addEdge("CA", "C", "A");
  sleep();

  // graph.clear();
    }
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
import org.junit.Test;

public class TestGraph {
  @Test
  public void testBasic() {
    testBasic(new SingleGraph("sg"));
    testBasic(new MultiGraph("mg"));
    testBasic(new AdjacencyListGraph("alg"));
    testBasic(new AdjacencyListGraph("AL")); // XXX
    testBasic(new SingleGraph("S")); // XXX
    testBasic(new MultiGraph("M")); // XXX
  }
View Full Code Here
248
249
250
251
252
253
254
255
256
257
258
259
    assertEquals(A, AA.getTargetNode());   
  }

  @Test
  public void testDirected() {
    testDirected(new SingleGraph("sg"));
    testDirected(new MultiGraph("mg"));
    // testDirected( new AdjacencyListGraph( "alg" ) );
    testDirected(new AdjacencyListGraph("AL")); // XXX
    testDirected(new SingleGraph("S")); // XXX
    testDirected(new MultiGraph("M")); // XXX
  }
View Full Code Here
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
    assertEquals(4, A.getDegree());
  }

  @Test
  public void testSingle() {
    SingleGraph graph = new SingleGraph("g");
    Node A = graph.addNode("A");
    Node B = graph.addNode("B");

    graph.addEdge("AB1", "A", "B");

    try {
      graph.addEdge("AB2", "A", "B");
      fail();
    } catch (Exception e) {
      // Ok !
    }
View Full Code Here
408
409
410
411
412
413
414
415
416
417
418
419
    assertEquals(1, B.getDegree());
  }

  @Test
  public void testIterables() {
    testIterables(new SingleGraph("sg"));
    testIterables(new MultiGraph("mg"));
    // testIterables( new AdjacencyListGraph( "alg" ) );
    testIterables(new AdjacencyListGraph("AL")); // XXX
    testIterables(new SingleGraph("S")); // XXX
    testIterables(new MultiGraph("M")); // XXX
  }
View Full Code Here
551
552
553
554
555
556
557
558
559
560
561
562
    edges.clear();
  }

  @Test
  public void testRemoval() {
    testRemoval(new SingleGraph("sg"));
    testRemoval(new MultiGraph("mg"));
    // testRemoval( new AdjacencyListGraph( "alg" ) );
    testRemoval(new AdjacencyListGraph("AL")); // XXX
    testRemoval(new SingleGraph("S")); // XXX
    testRemoval(new MultiGraph("M")); // XXX
  }
View Full Code Here
659
660
661
662
663
664
665
666
667
668
669
670
    assertEquals(0, graph.getEdgeCount());
  }

  @Test
  public void testGraphListener() {
    testGraphListener(new SingleGraph("sg"));
    testGraphListener(new MultiGraph("mg"));
    // testGraphListener( new AdjacencyListGraph( "alg" ) );
    testGraphListener(new AdjacencyListGraph("AL")); // XXX
    testGraphListener(new SingleGraph("S")); // XXX
    testGraphListener(new MultiGraph("M")); // XXX
  }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
    // /-------> g2
    // | |
    // g1 <-------/

    testGraphSyncBase(new MultiGraph("g1"), new MultiGraph("g2"));
    testGraphSyncBase(new SingleGraph("g1"), new SingleGraph("g2"));
    testGraphSyncBase(new AdjacencyListGraph("g1"), new AdjacencyListGraph(
        "g2"));
    testGraphSyncBase(new MultiGraph("g1"), new AdjacencyListGraph("g2"));
   
  }
View Full Code Here
175
176
177
178
179
180
181
182
183
184
185
186
    // | |
    // g1 <--------------------/

    testGraphSyncCycleSimple(new MultiGraph("g1"), new MultiGraph("g2"),
        new MultiGraph("g3"));
    testGraphSyncCycleSimple(new SingleGraph("g1"), new SingleGraph("g2"),
        new SingleGraph("g3"));
    testGraphSyncCycleSimple(new AdjacencyListGraph("g1"),
        new AdjacencyListGraph("g2"), new AdjacencyListGraph("g3"));
    testGraphSyncCycleSimple(new MultiGraph("g1"), new SingleGraph("g2"),
        new AdjacencyListGraph("g3"));
  }
View Full Code Here
202
203
204
205
206
207
208
209
210
211
212
213
    // | |
    // g1 <--------------------/

    testGraphSyncCycleProblem(new MultiGraph("g1"), new MultiGraph("g2"),
        new MultiGraph("g3"));
    testGraphSyncCycleProblem(new SingleGraph("g1"), new SingleGraph("g2"),
        new SingleGraph("g3"));
    testGraphSyncCycleProblem(new AdjacencyListGraph("g1"),
        new AdjacencyListGraph("g2"), new AdjacencyListGraph("g3"));
    testGraphSyncCycleProblem(new MultiGraph("g1"), new SingleGraph("g2"),
        new AdjacencyListGraph("g3"));
  }
View Full Code Here
TOP

Related Classes of org.graphstream.graph.implementations.SingleGraph

  • org.graphstream.graph.test.BenchPerformance
  • org.graphstream.graph.test.TestGenericity
  • org.graphstream.graph.test.TestGraph
  • org.graphstream.graph.test.TestGraphSynchronisation
  • org.graphstream.stream.gephi.test.ExampleJSONSender
    • 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.