Package org.graphstream.graph

Examples of org.graphstream.graph.Node

324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
  @Test
  public void testElementIterables() {
    Graph graph = new MultiGraph("g1");

    Node A = graph.addNode("A");

    assertEquals("A", A.getId());
    assertEquals(0, A.getAttributeCount());

    // First attribute of.

    A.addAttribute("A", "a");
    A.addAttribute("B", "b");
    A.addAttribute("C", "c");

    assertEquals(3, A.getAttributeCount());

    HashSet<String> keys = new HashSet<String>();

    for (String key : A.getAttributeKeySet())
      keys.add(key);

    assertEquals(3, keys.size());
    assertTrue(keys.contains("A"));
    assertTrue(keys.contains("B"));
View Full Code Here
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
  protected void testUndirectedTriangle() {
    assertEquals(3, inGraph.getNodeCount());
    assertEquals(3, inGraph.getEdgeCount());

    Node A = inGraph.getNode("A");
    Node B = inGraph.getNode("B");
    Node C = inGraph.getNode("C");

    assertNotNull(A);
    assertNotNull(B);
    assertNotNull(C);

    if (formatHandlesEdgesIDs) {
      assertNotNull(inGraph.getEdge("AB"));
      assertNotNull(inGraph.getEdge("BC"));
      assertNotNull(inGraph.getEdge("CA"));
    }

    assertTrue(A.hasEdgeToward("B"));
    assertTrue(B.hasEdgeToward("C"));
    assertTrue(C.hasEdgeToward("A"));
    assertTrue(A.hasEdgeToward("C"));
    assertTrue(B.hasEdgeToward("A"));
    assertTrue(C.hasEdgeToward("B"));
  }
View Full Code Here
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
  protected void testDirectedTriangle() {
    assertEquals(3, inGraph.getNodeCount());
    assertEquals(3, inGraph.getEdgeCount());

    Node A = inGraph.getNode("A");
    Node B = inGraph.getNode("B");
    Node C = inGraph.getNode("C");

    assertNotNull(A);
    assertNotNull(B);
    assertNotNull(C);

    assertTrue(A.hasEdgeToward("B"));
    assertTrue(A.hasEdgeToward("C"));
    assertFalse(B.hasEdgeToward("A"));
    assertTrue(B.hasEdgeToward("C"));
    assertFalse(C.hasEdgeToward("A"));
    assertTrue(C.hasEdgeToward("B"));

    Edge AB = A.getEdgeToward("B");
    Edge BC = B.getEdgeToward("C");
    Edge CA = A.getEdgeToward("C");
View Full Code Here
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
  protected void testAttributedTriangle() {
    assertEquals(3, inGraph.getNodeCount());
    assertEquals(3, inGraph.getEdgeCount());

    Node A = inGraph.getNode("A");
    Node B = inGraph.getNode("B");
    Node C = inGraph.getNode("C");

    assertNotNull(A);
    assertNotNull(B);
    assertNotNull(C);

    assertEquals(1, inGraph.getAttribute("a"));
    assertEquals("foo", inGraph.getAttribute("b"));

    assertEquals(1, A.getAttribute("a"));
    assertEquals("foo", B.getAttribute("b"));
    assertEquals("bar", C.getAttribute("c"));
  }
View Full Code Here
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
  protected void testDynamicTriangleStep0_1() {
    assertEquals(3, inGraph.getNodeCount());
    assertEquals(0, inGraph.getEdgeCount());

    Node A = inGraph.getNode("A");
    Node B = inGraph.getNode("B");
    Node C = inGraph.getNode("C");

    assertNotNull(A);
    assertNotNull(B);
    assertNotNull(C);

    assertEquals(0, A.getAttributeCount());
    assertEquals(0, B.getAttributeCount());
    assertEquals(0, C.getAttributeCount());
  }
View Full Code Here
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
  protected void testDynamicTriangleStep1_2() {
    assertEquals(3, inGraph.getNodeCount());
    assertEquals(3, inGraph.getEdgeCount());

    Node A = inGraph.getNode("A");
    Node B = inGraph.getNode("B");
    Node C = inGraph.getNode("C");

    assertNotNull(A);
    assertNotNull(B);
    assertNotNull(C);

    assertTrue(A.hasEdgeToward("B"));
    assertTrue(A.hasEdgeToward("C"));
    assertTrue(B.hasEdgeToward("A"));
    assertTrue(B.hasEdgeToward("C"));
    assertTrue(C.hasEdgeToward("A"));
    assertTrue(C.hasEdgeToward("B"));
  }
View Full Code Here
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
  protected void testDynamicTriangleStep2_3() {
    assertEquals(3, inGraph.getNodeCount());
    assertEquals(3, inGraph.getEdgeCount());

    Node A = inGraph.getNode("A");
    Node B = inGraph.getNode("B");
    Node C = inGraph.getNode("C");

    assertNotNull(A);
    assertNotNull(B);
    assertNotNull(C);

    assertTrue(inGraph.hasAttribute("a"));
    assertTrue(inGraph.hasAttribute("b"));
    assertTrue(A.hasAttribute("a"));
    assertTrue(B.hasAttribute("b"));
    assertTrue(C.hasAttribute("c"));

    assertEquals(1, inGraph.getAttribute("a"));
    assertEquals("foo", inGraph.getAttribute("b"));
    assertEquals(1, A.getAttribute("a"));
    assertEquals("foo", B.getAttribute("b"));
    assertEquals("bar", C.getAttribute("c"));
  }
View Full Code Here
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
  protected void testDynamicTriangleStep3_4() {
    assertEquals(2, inGraph.getNodeCount());
    assertEquals(1, inGraph.getEdgeCount());

    Node A = inGraph.getNode("A");
    Node B = inGraph.getNode("B");
    Node C = inGraph.getNode("C");

    assertNull(A);
    assertNotNull(B);
    assertNotNull(C);

    assertFalse(B.hasEdgeToward("A"));
    assertTrue(B.hasEdgeToward("C"));
    assertFalse(C.hasEdgeToward("A"));
    assertTrue(C.hasEdgeToward("B"));
  }
View Full Code Here
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
  protected void testDynamicTriangleStep4() {
    assertEquals(2, inGraph.getNodeCount());
    assertEquals(0, inGraph.getEdgeCount());

    Node A = inGraph.getNode("A");
    Node B = inGraph.getNode("B");
    Node C = inGraph.getNode("C");

    assertNull(A);
    assertNotNull(B);
    assertNotNull(C);

    assertFalse(B.hasEdgeToward("A"));
    assertFalse(B.hasEdgeToward("C"));
    assertFalse(C.hasEdgeToward("A"));
    assertFalse(C.hasEdgeToward("B"));
  }
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
124
    int foo = 0;

    // access each node by id
    start = System.currentTimeMillis();
    for (String id : nodeIds) {
      Node n = g.getNode(id);
      if (n.hasAttribute("foo"))
        foo++;
    }
    end = System.currentTimeMillis();
    measureValues.put(Measures.NODE_BY_ID, end - start);
View Full Code Here
TOP

Related Classes of org.graphstream.graph.Node

  • jsprit.analysis.toolbox.GraphStreamViewer
  • kr.ac.yonsei.crawler.KevinBaconGame
  • org.graphstream.graph.implementations.AbstractGraph
  • org.graphstream.graph.implementations.AbstractGraph$GraphReplayController
  • org.graphstream.graph.implementations.Graphs
  • org.graphstream.graph.implementations.Graphs$SynchronizedGraph
  • org.graphstream.graph.test.BenchPerformance
  • org.graphstream.graph.test.TestElement
  • org.graphstream.graph.test.TestGenericity$TestAddRemoveNode
  • org.graphstream.graph.test.TestGenericity$TestEdgeExtremities
    • 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.