Package org.gephi.graph.api

Examples of org.gephi.graph.api.Graph.removeNode()


      Graph vgraph = model.getGraph(currentView);
      for (Node n : vgraph.getNodes().toArray()) {
        TimeInterval ti = (TimeInterval)n.getNodeData().getAttributes().getValue(
            DynamicModel.TIMEINTERVAL_COLUMN);
        if (!ti.isInRange(low, high))
          vgraph.removeNode(n);
      }
      for (Edge e : vgraph.getEdges().toArray()) {
        TimeInterval ti = (TimeInterval)e.getEdgeData().getAttributes().getValue(
            DynamicModel.TIMEINTERVAL_COLUMN);
        if (!ti.isInRange(low, high))
View Full Code Here


    for (Node n : graph.getNodes().toArray()) {
      TimeInterval ti = (TimeInterval)n.getNodeData().getAttributes().getValue(DynamicModel.TIMEINTERVAL_COLUMN);
                        if(ti == null && !vgraph.contains(n))
                                vgraph.addNode(n);
                        else if(ti != null && ti.getValue(interval, estimator) == null && vgraph.contains(n))
        vgraph.removeNode(n);
      else if (ti != null && ti.getValue(interval, estimator) != null && !vgraph.contains(n))
        vgraph.addNode(n);
    }
    for (Edge e : graph.getEdges().toArray()) {
      TimeInterval ti = (TimeInterval)e.getEdgeData().getAttributes().getValue(DynamicModel.TIMEINTERVAL_COLUMN);
View Full Code Here

    Graph graph  = model.getGraph(sourceView);
    Graph vgraph = model.getGraph(currentView);
    for (Node n : graph.getNodes().toArray()) {
      TimeInterval ti = (TimeInterval)n.getNodeData().getAttributes().getValue(DynamicModel.TIMEINTERVAL_COLUMN);
      if (ti.getValues(interval).size() < ti.getValues().size() && vgraph.contains(n))
        vgraph.removeNode(n);
      else if (ti.getValues(interval).size() == ti.getValues().size() && !vgraph.contains(n))
        vgraph.addNode(n);
    }
    for (Edge e : graph.getEdges().toArray()) {
      TimeInterval ti = (TimeInterval)e.getEdgeData().getAttributes().getValue(DynamicModel.TIMEINTERVAL_COLUMN);
View Full Code Here

        assertNotSame(n1, n1c);
        assertSame(n1.getNodeData(), n1c.getNodeData());
        assertEquals(((AbstractNode) n1c).getViewId(), newView.getViewId());
        assertSame(n1c, graphNewView.getNode(n1.getId()));

        graphNewView.removeNode(n1c);
        assertNull(graphNewView.getNode("n1"));
        assertNotNull(rootGraph.getNode("n1"));

        rootGraph.removeNode(n1);
        assertNull(rootGraph.getNode("n1"));
View Full Code Here

            Graph vgraph = model.getGraph(currentView);
            for (Node n : vgraph.getNodes().toArray()) {
                TimeInterval ti = (TimeInterval) n.getNodeData().getAttributes().getValue(
                        DynamicModel.TIMEINTERVAL_COLUMN);
                if (ti != null && !ti.isInRange(low, high)) {
                    vgraph.removeNode(n);
                }
            }
            for (Edge e : vgraph.getEdges().toArray()) {
                TimeInterval ti = (TimeInterval) e.getEdgeData().getAttributes().getValue(
                        DynamicModel.TIMEINTERVAL_COLUMN);
View Full Code Here

                    vgraph.addNode(n);
                } else if (ti != null) {
                    boolean isInRange = ti.isInRange(interval);
                    boolean isInGraph = vgraph.contains(n);
                    if (!isInRange && isInGraph) {
                        vgraph.removeNode(n);
                    } else if (isInRange && !isInGraph) {
                        vgraph.addNode(n);
                    }
                }
            }
View Full Code Here

        Graph graph = model.getGraph(sourceView);
        Graph vgraph = model.getGraph(currentView);
        for (Node n : graph.getNodes().toArray()) {
            TimeInterval ti = (TimeInterval) n.getNodeData().getAttributes().getValue(DynamicModel.TIMEINTERVAL_COLUMN);
            if (ti.getValues(interval).size() < ti.getValues().size() && vgraph.contains(n)) {
                vgraph.removeNode(n);
            } else if (ti.getValues(interval).size() == ti.getValues().size() && !vgraph.contains(n)) {
                vgraph.addNode(n);
            }
        }
        for (Edge e : graph.getEdges().toArray()) {
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. 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.