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

org.gephi.graph.api.Graph.removeEdge()
Remove edge from the graph. Fails if the edge doesn't exist. @param edge the edge to remove @return true if remove is successful, false otherwise @throws IllegalArgumentException if edge is null or nodes not legal inthe graph @throws IllegalMonitorStateException if the current thread is holding a read lock

      }
      for (Edge e : vgraph.getEdges().toArray()) {
        TimeInterval ti = (TimeInterval)e.getEdgeData().getAttributes().getValue(
            DynamicModel.TIMEINTERVAL_COLUMN);
        if (!ti.isInRange(low, high))
          vgraph.removeEdge(e);
      }
    }
  }


  @Override

View Full Code Here

      TimeInterval ti = (TimeInterval)e.getEdgeData().getAttributes().getValue(DynamicModel.TIMEINTERVAL_COLUMN);
                        if(ti == null && !vgraph.contains(e) &&
          vgraph.contains(e.getSource()) && vgraph.contains(e.getTarget()))
                                vgraph.addEdge(e);
                        else if(ti != null && ti.getValue(interval, estimator) == null && vgraph.contains(e))
        vgraph.removeEdge(e);
      else if (ti != null && ti.getValue(interval, estimator) != null && !vgraph.contains(e) &&
          vgraph.contains(e.getSource()) && vgraph.contains(e.getTarget()))
        vgraph.addEdge(e);
    }
    return vgraph;

View Full Code Here

        vgraph.addNode(n);
    }
    for (Edge e : graph.getEdges().toArray()) {
      TimeInterval ti = (TimeInterval)e.getEdgeData().getAttributes().getValue(DynamicModel.TIMEINTERVAL_COLUMN);
      if (ti.getValues(interval).size() < ti.getValues().size() && vgraph.contains(e))
        vgraph.removeEdge(e);
      else if (ti.getValues(interval).size() == ti.getValues().size() && !vgraph.contains(e) &&
          vgraph.contains(e.getSource()) && vgraph.contains(e.getTarget()))
        vgraph.addEdge(e);
    }
    return vgraph;

View Full Code Here

        Graph graphNewView = graphModel.getGraph(newView);
        assertNotNull(graphNewView.getEdge(e1.getId()));
        assertNotNull(graphNewView.getEdge(e1.getEdgeData().getId()));
        assertSame(e1, graphNewView.getEdge(e1.getId()));


        graphNewView.removeEdge(graphNewView.getEdge(e1.getId()));
        assertSame(e1, rootGraph.getEdge(e1.getId()));


        newView = graphModel.newView();
        assertNotNull(rootGraph.getEdge(e1.getId()));
        ((Dhns) graphModel).destroyView(newView);

View Full Code Here

            int removed = 0;
            Graph graph = graphModel.getGraph();
            graph.writeLock();
            for(Edge edge : graph.getEdges().toArray()) {
                if(edge.isSelfLoop()) {
                    graph.removeEdge(edge);
                    removed++;
                }
            }
            graph.writeUnlock();

View Full Code Here

            }
            for (Edge e : vgraph.getEdges().toArray()) {
                TimeInterval ti = (TimeInterval) e.getEdgeData().getAttributes().getValue(
                        DynamicModel.TIMEINTERVAL_COLUMN);
                if (ti != null && !ti.isInRange(low, high)) {
                    vgraph.removeEdge(e);
                }
            }
        }
    }

View Full Code Here

                    vgraph.addEdge(e);
                } else if (ti != null) {
                    boolean isInRange = ti.isInRange(interval);
                    boolean isInGraph = vgraph.contains(e);
                    if (!isInRange && isInGraph) {
                        vgraph.removeEdge(e);
                    } else if (isInRange && !isInGraph && vgraph.contains(e.getSource()) && vgraph.contains(e.getTarget())) {
                        vgraph.addEdge(e);
                    }
                }
            }

View Full Code Here

            }
        }
        for (Edge e : graph.getEdges().toArray()) {
            TimeInterval ti = (TimeInterval) e.getEdgeData().getAttributes().getValue(DynamicModel.TIMEINTERVAL_COLUMN);
            if (ti.getValues(interval).size() < ti.getValues().size() && vgraph.contains(e)) {
                vgraph.removeEdge(e);
            } else if (ti.getValues(interval).size() == ti.getValues().size() && !vgraph.contains(e)
                    && vgraph.contains(e.getSource()) && vgraph.contains(e.getTarget())) {
                vgraph.addEdge(e);
            }
        }

View Full Code Here

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.