Examples of org.graphstream.graph.Node

org.graphstream.graph.Node
An Interface that advises general purpose methods for handling nodes as elements of a graph.
Important

Implementing classes should indicate the complexity of their implementation for each method.
@since July 12 2007


  protected void directedTriangleTests() {
    assertEquals(3, graph.getEdgeCount());
    assertEquals(3, graph.getNodeCount());


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


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


    if (testEdgeIds) {
      Edge AB = graph.getEdge("AB");
      Edge BC = graph.getEdge("BC");
      Edge CA = graph.getEdge("CA");


      assertNotNull(AB);
      assertNotNull(BC);
      assertNotNull(CA);


      assertTrue(AB.isDirected());
      assertFalse(BC.isDirected());
      assertTrue(CA.isDirected());


      assertEquals("A", AB.getNode0().getId());
      assertEquals("B", AB.getNode1().getId());
      assertEquals("B", BC.getNode0().getId());
      assertEquals("C", BC.getNode1().getId());
      assertEquals("A", CA.getNode0().getId());
      assertEquals("C", CA.getNode1().getId());
    }


    assertTrue(A.hasEdgeToward("B"));
    assertTrue(A.hasEdgeToward("C"));
    assertTrue(B.hasEdgeToward("C"));
    assertFalse(B.hasEdgeToward("A"));
    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


  protected void basicAttributesTests() {
    assertEquals(3, graph.getEdgeCount());
    assertEquals(3, graph.getNodeCount());


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


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


    assertTrue(A.hasAttribute("a"));
    assertTrue(A.hasAttribute("b"));
    assertTrue(A.hasAttribute("c"));
    assertTrue(B.hasAttribute("aa"));
    assertTrue(B.hasAttribute("bb"));
    assertTrue(B.hasAttribute("cc"));
    assertTrue(C.hasAttribute("aaa"));


    assertEquals(1.0, A.getAttribute("a"));
    assertEquals("truc", A.getAttribute("b"));
    assertEquals("true", A.getAttribute("c"));


    assertNotNull(B.getAttribute("aa"));
    assertEquals("foo", B.getAttribute("bb"));
    assertEquals("bar", B.getAttribute("cc"));


    assertEquals(1.234, C.getAttribute("aaa"));
  }

View Full Code Here


  protected void generateRandom(Graph g, int size) {
    String[] attributes = { "a", "b", "c", "d", "e", "f", "g" };


    for (int i = 0; i < size; i++) {
      Node n = g.addNode(String.format("%d", i));


      for (int j = 0; j < 3; j++)
        n.setAttribute(attributes[ri(attributes.length)], rv());
    }


    for (int i = 0; i < size; i++) {
      Node a, b;


      a = g.getNode((int) (Math.random() * size));


      do {
        b = g.getNode((int) (Math.random() * size));

View Full Code Here

  }


  @Test
  public void testArrayAttribute() throws IOException {
    Graph g = getGraph("data/attributes_array.dgs");
    Node n = g.getNode(0);


    if (!n.hasArray("a1"))
      fail();


    if (!n.hasArray("a2"))
      fail();


    Object[] a1 = n.getArray("a1");
    Object[] a2 = n.getArray("a2");
    Object[] expected = { "A", "B", "C" };


    assertArrayEquals(expected, a1);
    assertArrayEquals(expected, a2);
  }

View Full Code Here


  @Test
  public void testElements() throws IOException {
    Graph g = getGraph("data/elements.dgs");


    Node A, B, C;
    Edge AB, AC, BC;


    A = g.getNode("A");
    B = g.getNode("B");
    C = g.getNode("C");

View Full Code Here

  static class TestAddRemoveNode<A extends Node> {
    @SuppressWarnings("unused")
    TestAddRemoveNode(Graph g) {
      A goodTypedNode;
      BadTypedNode badTypedNode;
      Node simpleNode;


      try {
        goodTypedNode = g.addNode("test-add-remove-node-A");
        simpleNode = g.addNode("test-add-remove-node-N");
      } catch (ClassCastException e) {

View Full Code Here

          A goodTypedNode = iA.next();
        }


        Iterator<Node> iN = g.getNodeIterator();
        while (iN.hasNext()) {
          Node n = iN.next();
        }
      } catch (ClassCastException e) {
        fail();
      }

View Full Code Here

        g.addNode(String.format("ext-%02d", i));
        g.addEdge(String.format("edge-%02d", i), "root",
            String.format("ext-%02d", i));
      }


      Node root = g.getNode("root");


      try {
        for (A edge : root.<A> getEdgeSet())
          ;
        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) {
      }


      try {
        for (BadTypedEdge bte : root.<BadTypedEdge> getEdgeSet()) {
          fail();
        }
      } catch (ClassCastException e) {
      }


      try {
        for (int i = 0; i < 10; i++) {
          BadTypedEdge bte = g.getEdge(String.format("edge-%02d", i));
          fail();
        }
      } catch (ClassCastException e) {
      }


      try {
        Iterator<BadTypedEdge> iB;


        iB = root.getLeavingEdgeIterator();
        while (iB.hasNext()) {
          BadTypedEdge e = iB.next();
          fail();
        }
      } catch (ClassCastException e) {
      } catch (UnsupportedOperationException e) {
      }


      try {
        Iterator<BadTypedEdge> iB;


        iB = root.getEnteringEdgeIterator();
        while (iB.hasNext()) {
          BadTypedEdge e = iB.next();
          fail();
        }
      } catch (ClassCastException e) {

View Full Code Here

        g.addNode(String.format("ext-%02d", i));
        g.addEdge(String.format("edge-%02d", i), "root",
            String.format("ext-%02d", i));
      }


      Node root = g.getNode("root");


      try {
        Iterator<A> iA;


        iA = root.getBreadthFirstIterator();
        while (iA.hasNext()) {
          A node = iA.next();
        }


        iA = root.getDepthFirstIterator();
        while (iA.hasNext()) {
          A node = iA.next();
        }


        Iterator<Node> iN;


        iN = root.getBreadthFirstIterator();
        while (iN.hasNext()) {
          Node node = iN.next();
        }


        iN = root.getDepthFirstIterator();
        while (iN.hasNext()) {
          Node node = iN.next();
        }
      } catch (ClassCastException e) {
        fail();
      } catch (UnsupportedOperationException e) {
      }

View Full Code Here

          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) {
          }

View Full Code Here

0 1 2 3 4 5 6 7

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

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.

Examples of org.graphstream.graph.Node

Important

Related Classes of org.graphstream.graph.Node