Package org.graphstream.graph

Examples of org.graphstream.graph.Edge

110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
          g.addSink(nsc);

          g.addAttribute("attribute", "foo");
          g.changeAttribute("attribute", false);
          Edge e = g.addEdge("AB", "A", "B");
          e.addAttribute("attribute", "foo");
          e.changeAttribute("attribute", false);
          Node n = e.getNode0();
          n.addAttribute("attribute", "foo");
          n.changeAttribute("attribute", false);

          try {
            nsc.close();
          } catch (IOException e1) {
          }
        }
      };

      t.start();

      try {
        t.join();
      } catch (InterruptedException e) {
        fail(e.getMessage());
      }

      while (pipe.hasPostRemaining() || net.hasActiveConnections()) {
        pipe.pump();
View Full Code Here
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
          return;
        }

        g.addSink(nsc);
        Node node0 = g.addNode("node0");
        Edge edge = g.addEdge("edge", "node0", "node1", true);
        node0.addAttribute("nodeAttribute", 0);
        node0.changeAttribute("nodeAttribute", 1);
        node0.removeAttribute("nodeAttribute");
        edge.addAttribute("edgeAttribute", 0);
        edge.changeAttribute("edgeAttribute", 1);
        edge.removeAttribute("edgeAttribute");
        g.addAttribute("graphAttribute", 0);
        g.changeAttribute("graphAttribute", 1);
        g.removeAttribute("graphAttribute");
        g.stepBegins(1.1);
        g.removeEdge("edge");
View Full Code Here
315
316
317
318
319
320
321
322
323
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
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
      g.addNode("4");
      g.addNode("5");

      try {
        A goodTypedEdge = g.addEdge("e0", "0", "1");
        Edge e = g.addEdge("e1", "1", "2");
      } catch (ClassCastException e) {
        fail();
      }

      try {
        BadTypedEdge bte = g.addEdge("e2", "2", "3");
        fail();
      } catch (ClassCastException e) {
      }

      assertNotNull(g.getEdge("e0"));
      assertNotNull(g.getEdge("e1"));
      assertNotNull(g.getEdge("e2"));

      // Get

      try {
        A goodTypedEdge;

        goodTypedEdge = g.getEdge("e0");
        goodTypedEdge = g.getEdge("e1");
        goodTypedEdge = g.getEdge("e2");

        Edge e;

        e = g.getEdge("e0");
        e = g.getEdge("e1");
        e = g.getEdge("e2");
      } catch (ClassCastException e) {
        fail();
      }

      try {
        BadTypedEdge bte;

        bte = g.getEdge("e0");
        fail();
        bte = g.getEdge("e1");
        fail();
        bte = g.getEdge("e2");
        fail();
      } catch (ClassCastException e) {
      }

      // Remove

      try {
        A goodTypedEdge = g.removeEdge("e0");
        Edge e = g.removeEdge("e1");
      } catch (ClassCastException e) {
        fail();
      }

      try {
View Full Code Here
512
513
514
515
516
517
518
519
520
521
522
          A goodTypedEdge = iA.next();
        }

        Iterator<Edge> iE = g.getEdgeIterator();
        while (iE.hasNext()) {
          Edge e = iE.next();
        }
      } catch (ClassCastException e) {
        fail();
      }
View Full Code Here
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
        for (Edge e : root.getEdgeSet())
          ;

        for (int i = 0; i < 10; i++) {
          A edge = root.getEdge(i);
          Edge e = root.getEdge(i);
        }

        Iterator<A> iA;

        iA = root.getLeavingEdgeIterator();
        while (iA.hasNext()) {
          A edge = iA.next();
        }

        iA = root.getEnteringEdgeIterator();
        while (iA.hasNext()) {
          A edge = iA.next();
        }

        Iterator<Edge> iE;

        iE = root.getLeavingEdgeIterator();
        while (iE.hasNext()) {
          Edge e = iE.next();
        }

        iE = root.getEnteringEdgeIterator();
        while (iE.hasNext()) {
          Edge e = iE.next();
        }
      } catch (ClassCastException e) {
        fail();
      } catch (UnsupportedOperationException e) {
      }
View Full Code Here
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
      g.addNode("0");
      g.addNode("1");

      g.addEdge("A", "0", "1");

      Edge edge = g.getEdge("A");

      try {
        A nodeA;

        nodeA = edge.getNode0();
        nodeA = edge.getSourceNode();
        nodeA = edge.getNode1();
        nodeA = edge.getTargetNode();
      } catch (ClassCastException e) {
        fail();
      }

      try {
        Node nodeA;

        nodeA = edge.getNode0();
        nodeA = edge.getSourceNode();
        nodeA = edge.getNode1();
        nodeA = edge.getTargetNode();
      } catch (ClassCastException e) {
        fail();
      }

      try {
        BadTypedNode nodeA;

        nodeA = edge.getNode0();
        fail();
        nodeA = edge.getSourceNode();
        fail();
        nodeA = edge.getNode1();
        fail();
        nodeA = edge.getTargetNode();
        fail();
      } catch (ClassCastException e) {
      }

      g.clear();
View Full Code Here
449
450
451
452
453
454
455
456
457
458
459
   * (non-Javadoc)
   *
   * @see org.graphstream.graph.Graph#removeEdge(java.lang.String)
   */
  public <T extends Edge> T removeEdge(String id) {
    Edge edge = getEdge(id);

    if (edge == null) {
      if (strictChecking)
        throw new ElementNotFoundException("Edge \"" + id
            + "\" not found. Cannot remove it.");
View Full Code Here
467
468
469
470
471
472
473
474
475
476
477
   * (non-Javadoc)
   *
   * @see org.graphstream.graph.Graph#removeEdge(int)
   */
  public <T extends Edge> T removeEdge(int index) {
    Edge edge = getEdge(index);

    if (edge == null) {
      if (strictChecking)
        throw new ElementNotFoundException("Edge #" + index
            + " not found. Cannot remove it.");
View Full Code Here
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
            sendNodeAttributeAdded(sourceId, nodeId, key,
                node.getAttribute(key));
      }

      for (int i = 0; i < getEdgeCount(); i++) {
        Edge edge = getEdge(i);
        String edgeId = edge.getId();

        sendEdgeAdded(sourceId, edgeId, edge.getNode0().getId(), edge
            .getNode1().getId(), edge.isDirected());

        if (edge.getAttributeCount() > 0)
          for (String key : edge.getAttributeKeySet())
            sendEdgeAttributeAdded(sourceId, edgeId, key,
                edge.getAttribute(key));
      }
    }
View Full Code Here
TOP

Related Classes of org.graphstream.graph.Edge

  • jsprit.analysis.toolbox.GraphStreamViewer
  • 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.TestGenericity$TestAddRemoveEdge
  • org.graphstream.graph.test.TestGenericity$TestEdgeCollection
  • org.graphstream.graph.test.TestGenericity$TestEdgeExtremities
  • org.graphstream.graph.test.TestGenericity$TestNodeEdgeSet
    • 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.