Examples of org.graphstream.graph.Graph.addNode()

org.graphstream.graph.Graph.addNode()
Add a node in the graph.
This acts as a factory, creating the node instance automatically (and eventually using the node factory provided). An event is generated toward the listeners. If strict checking is enabled, and a node already exists with this identifier, an {@link org.graphstream.graph.IdAlreadyInUseException} is raised. Else theerror is silently ignored and the already existing node is returned.

This method is implicitly generic and returns something which extends Node. The return type is the one of the left part of the assignment. For example, in the following call :
```
 ExtendedNode n = graph.addNode("..."); 
```
the method will return an ExtendedNode. If no left part exists, method will just return a Node.
@param id Arbitrary and unique string identifying the node. @return The created node (or the already existing node). @throws IdAlreadyInUseException If strict checking is enabled the identifier is already used.

    GraphSpells graphSpells = new GraphSpells();
    Graph g = new AdjacencyListGraph("g");


    g.addSink(graphSpells);


    g.addNode("A");
    g.addNode("B");
    g.addNode("C");
    g.stepBegins(1);
    g.getNode("A").setAttribute("test1", 100);
    g.addEdge("AB", "A", "B");

View Full Code Here

    Graph g = new AdjacencyListGraph("g");


    g.addSink(graphSpells);


    g.addNode("A");
    g.addNode("B");
    g.addNode("C");
    g.stepBegins(1);
    g.getNode("A").setAttribute("test1", 100);
    g.addEdge("AB", "A", "B");
    g.addEdge("AC", "A", "C");

View Full Code Here


    g.addSink(graphSpells);


    g.addNode("A");
    g.addNode("B");
    g.addNode("C");
    g.stepBegins(1);
    g.getNode("A").setAttribute("test1", 100);
    g.addEdge("AB", "A", "B");
    g.addEdge("AC", "A", "C");
    g.stepBegins(2);

View Full Code Here

    g.addEdge("AC", "A", "C");
    g.stepBegins(2);
    g.addEdge("CB", "C", "B");
    g.removeNode("A");
    g.stepBegins(3);
    g.addNode("A");
    g.addEdge("AB", "A", "B");
    g.stepBegins(4);
    g.removeNode("C");
    g.stepBegins(5);

View Full Code Here

    timeline.addSink(new VerboseSink());


    timeline.begin(g);


    g.stepBegins(0.0);
    g.addNode("A");
    g.addNode("B");
    g.stepBegins(1.0);
    g.addNode("C");


    timeline.end();

View Full Code Here


    timeline.begin(g);


    g.stepBegins(0.0);
    g.addNode("A");
    g.addNode("B");
    g.stepBegins(1.0);
    g.addNode("C");


    timeline.end();

View Full Code Here


    g.stepBegins(0.0);
    g.addNode("A");
    g.addNode("B");
    g.stepBegins(1.0);
    g.addNode("C");


    timeline.end();


    System.out.printf("############\n");
    System.out.printf("# Play :\n");

View Full Code Here

    Node a1 = g1.addNode("A");
    a1.addAttribute("attr1", "test");
    a1.addAttribute("attr2", 10.0);
    a1.addAttribute("attr3", 12);


    Node a2 = g2.addNode("A");
    a2.addAttribute("attr1", "test1");
    a2.addAttribute("attr2", 10.0);
    g2.addNode("B");
    g2.addNode("C");

View Full Code Here

    a1.addAttribute("attr3", 12);


    Node a2 = g2.addNode("A");
    a2.addAttribute("attr1", "test1");
    a2.addAttribute("attr2", 10.0);
    g2.addNode("B");
    g2.addNode("C");


    GraphDiff diff = new GraphDiff(g2, g1);
    System.out.println(diff);
  }

View Full Code Here


    Node a2 = g2.addNode("A");
    a2.addAttribute("attr1", "test1");
    a2.addAttribute("attr2", 10.0);
    g2.addNode("B");
    g2.addNode("C");


    GraphDiff diff = new GraphDiff(g2, g1);
    System.out.println(diff);
  }
}

View Full Code Here

0 1 2 3 4

TOP

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.