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

org.graphstream.graph.Graph.stepBegins()

Since dynamic graphs are based on discrete event modifications, the notion of step is defined to simulate elapsed time between events. So a step is a event that occurs in the graph, it does not modify it but it gives a kind of timestamp that allows the tracking of the progress of the graph over the time.

This kind of event is useful for dynamic algorithms that listen to the dynamic graph and need to measure the time in the graph's evolution.
@param time A numerical value that may give a timestamp to track the evolution of the graph over the time.

    graph.addSink(out2);
    
    graph.addNode("A");
    graph.getNode("A").addAttribute("s", "foo bar");
    graph.addNode("B");
    graph.stepBegins(1);
    graph.addEdge("AB", "A", "B", true);
    graph.getEdge("AB").addAttribute("n", 1);
    graph.stepBegins(2);
    graph.addAttribute("b", true);
    graph.getNode("B").addAttribute("c", 'X');

View Full Code Here

    graph.getNode("A").addAttribute("s", "foo bar");
    graph.addNode("B");
    graph.stepBegins(1);
    graph.addEdge("AB", "A", "B", true);
    graph.getEdge("AB").addAttribute("n", 1);
    graph.stepBegins(2);
    graph.addAttribute("b", true);
    graph.getNode("B").addAttribute("c", 'X');
    graph.getNode("B").addAttribute("d", 'Y');
    graph.stepBegins(3);
    graph.getNode("B").removeAttribute("c");

View Full Code Here

    graph.getEdge("AB").addAttribute("n", 1);
    graph.stepBegins(2);
    graph.addAttribute("b", true);
    graph.getNode("B").addAttribute("c", 'X');
    graph.getNode("B").addAttribute("d", 'Y');
    graph.stepBegins(3);
    graph.getNode("B").removeAttribute("c");
    graph.removeAttribute("b");
    graph.removeNode("A");
    graph.removeNode("B");

View Full Code Here

        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");
        g.removeNode("node0");
        g.clear();


        try {

View Full Code Here

0 1

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.