List of removeEdge() Examples

Examples of removeEdge()

bgu.bio.adt.graphs.FlexibleGraph.removeEdge()
Remove an edge from the graph @param from the source of the edge @param to the target of the edge
com.evelopers.unimod.glayout.graph.SimpleGraph.removeEdge()
remove edge @param e
com.sun.hotspot.igv.data.InputGraph.removeEdge()
com.tinkerpop.blueprints.Graph.removeEdge()
Remove the provided edge from the graph. @param edge the edge to remove from the graph
com.tinkerpop.blueprints.KeyIndexableGraph.removeEdge()
com.tinkerpop.blueprints.impls.orient.OrientBaseGraph.removeEdge()
Removes an edge from the Graph. @param edge Edge to remove
de.timefinder.algo.graph.WeightedGraph.removeEdge()
diva.graph.GraphController.removeEdge()
Remove the given edge. Find the edge controller associated with that edge and delegate to that edge controller.
edu.indiana.extreme.xbaya.graph.DataPort.removeEdge()
edu.indiana.extreme.xbaya.graph.Graph.removeEdge()
Removes a specified edge. @param edge The edge to remove. @throws GraphException
edu.uci.ics.jung.graph.impl.DirectedSparseGraph.removeEdge()
edu.umd.cs.findbugs.ba.CFG.removeEdge()
org.apache.airavata.workflow.model.graph.DataPort.removeEdge()
org.apache.airavata.workflow.model.graph.Graph.removeEdge()
Removes a specified edge. @param edge The edge to remove. @throws GraphException
org.apache.airavata.xbaya.graph.DataPort.removeEdge()
org.apache.airavata.xbaya.graph.Graph.removeEdge()
Removes a specified edge. @param edge The edge to remove. @throws GraphException
org.codehaus.plexus.util.dag.DAG.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
org.gephi.graph.api.HierarchicalGraph.removeEdge()
org.gephi.graph.dhns.edge.MetaEdgeImpl.removeEdge()
org.gephi.graph.dhns.graph.HierarchicalDirectedGraphImpl.removeEdge()
org.gephi.visualization.model.node.NodeModel.removeEdge()
org.graphstream.graph.Graph.removeEdge()
Removes an edge with a given index. An event is sent toward the listeners.
This method is implicitly generic and returns something which extends Edge. The return type is the one of the left part of the assignment. For example, in the following call :
```
 ExtendedEdge edge = graph.removeEdge(i); 
```
the method will return an ExtendedEdge edge. If no left part exists, method will just return an Edge.
@param index The index of the edge to be removed. @return The removed edge @throws IndexOutOfBoundsException if the index is negative or greater than {@code getEdgeCount() - 1}
org.graphstream.graph.implementations.DefaultGraph.removeEdge()
org.graphstream.graph.implementations.MultiGraph.removeEdge()
org.mindswap.pellet.Individual.removeEdge()
ptolemy.graph.DirectedGraph.removeEdge()
y.base.Graph.removeEdge()

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph.removeEdge()

      Set<Label> usedInputs = new HashSet<Label>();
      for(DirectedSparseEdge e:(Set<DirectedSparseEdge>)newBlue.getInEdges())
      {
        Vertex source = e.getSource();
        Collection<Label> existingLabels = (Collection<Label>)e.getUserDatum(JUConstants.LABEL);
        g.removeEdge(e);


        // It is possible that there is already an edge between g.getSource Blue and newRed
        Iterator<DirectedSparseEdge> sourceOutIt = source.getOutEdges().iterator();
        Edge fromSourceToNewRed = null;
        while(sourceOutIt.hasNext() && fromSourceToNewRed == null)

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph.removeEdge()

      Set<Label> usedInputs = new HashSet<Label>();
      for(DirectedSparseEdge e:(Set<DirectedSparseEdge>)newBlue.getInEdges())
      {
        Vertex source = e.getSource();
        Collection<Label> existingLabels = (Collection<Label>)e.getUserDatum(JUConstants.LABEL);
        g.removeEdge(e);


        // It is possible that there is already an edge between g.getSource Blue and newRed
        Iterator<DirectedSparseEdge> sourceOutIt = source.getOutEdges().iterator();
        Edge fromSourceToNewRed = null;
        while(sourceOutIt.hasNext() && fromSourceToNewRed == null)

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph.removeEdge()

      Set<String> usedInputs = new HashSet<String>();
      for(DirectedSparseEdge e:(Set<DirectedSparseEdge>)newBlue.getInEdges())
      {
        Vertex source = e.getSource();
        Collection<String> existingLabels = (Collection<String>)e.getUserDatum(JUConstants.LABEL);
        g.removeEdge(e);


        // It is possible that there is already an edge between g.getSource Blue and newRed
        Iterator<DirectedSparseEdge> sourceOutIt = source.getOutEdges().iterator();
        Edge fromSourceToNewRed = null;
        while(sourceOutIt.hasNext() && fromSourceToNewRed == null)

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph.removeEdge()

      Set<Label> usedInputs = new HashSet<Label>();
      for(DirectedSparseEdge e:(Set<DirectedSparseEdge>)newBlue.getInEdges())
      {
        Vertex source = e.getSource();
        Collection<Label> existingLabels = (Collection<Label>)e.getUserDatum(JUConstants.LABEL);
        g.removeEdge(e);


        // It is possible that there is already an edge between g.getSource Blue and newRed
        Iterator<DirectedSparseEdge> sourceOutIt = source.getOutEdges().iterator();
        Edge fromSourceToNewRed = null;
        while(sourceOutIt.hasNext() && fromSourceToNewRed == null)

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph.removeEdge()

      Set<Label> usedInputs = new HashSet<Label>();
      for(DirectedSparseEdge e:(Set<DirectedSparseEdge>)newBlue.getInEdges())
      {
        Vertex source = e.getSource();
        Collection<Label> existingLabels = (Collection<Label>)e.getUserDatum(JUConstants.LABEL);
        g.removeEdge(e);


        // It is possible that there is already an edge between g.getSource Blue and newRed
        Iterator<DirectedSparseEdge> sourceOutIt = source.getOutEdges().iterator();
        Edge fromSourceToNewRed = null;
        while(sourceOutIt.hasNext() && fromSourceToNewRed == null)

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph.removeEdge()

      Set<Label> usedInputs = new HashSet<Label>();
      for(DirectedSparseEdge e:(Set<DirectedSparseEdge>)newBlue.getInEdges())
      {
        Vertex source = e.getSource();
        Collection<Label> existingLabels = (Collection<Label>)e.getUserDatum(JUConstants.LABEL);
        g.removeEdge(e);


        // It is possible that there is already an edge between g.getSource Blue and newRed
        Iterator<DirectedSparseEdge> sourceOutIt = source.getOutEdges().iterator();
        Edge fromSourceToNewRed = null;
        while(sourceOutIt.hasNext() && fromSourceToNewRed == null)

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph.removeEdge()

      Set<String> usedInputs = new HashSet<String>();
      for(DirectedSparseEdge e:(Set<DirectedSparseEdge>)newBlue.getInEdges())
      {
        Vertex source = e.getSource();
        Collection<String> existingLabels = (Collection<String>)e.getUserDatum(JUConstants.LABEL);
        g.removeEdge(e);


        // It is possible that there is already an edge between g.getSource Blue and newRed
        Iterator<DirectedSparseEdge> sourceOutIt = source.getOutEdges().iterator();
        Edge fromSourceToNewRed = null;
        while(sourceOutIt.hasNext() && fromSourceToNewRed == null)

View Full Code Here

Examples of edu.umd.cs.findbugs.ba.CFG.removeEdge()

                }
            }
            if (edgesToRemove.size() > 0) {
                changed = true;
                for (Edge e : edgesToRemove) {
                    cfg.removeEdge(e);
                }
            }
        }
        cfg.setFlag(CFG.PRUNED_FAILED_ASSERTION_EDGES);

View Full Code Here

Examples of org.apache.airavata.workflow.model.graph.DataPort.removeEdge()

            DataPort port = portItr.next();
            for (Iterator<DataEdge> edgeItr = port.getEdges().iterator(); edgeItr.hasNext();) {
                DataEdge edge = edgeItr.next();
                // Remove the edge from from-port.
                DataPort fromPort = edge.getFromPort();
                fromPort.removeEdge(edge);
                // remove the edge from this port. This is necessary so that
                // type update works properly.
                edgeItr.remove();


                // Remove the edge from the graph.

View Full Code Here

Examples of org.apache.airavata.workflow.model.graph.DataPort.removeEdge()

        for (Iterator<DataPort> portItr = nodeImpl.getOutputPorts().iterator(); portItr.hasNext();) {
            DataPort port = portItr.next();
            for (Iterator<DataEdge> edgeItr = port.getEdges().iterator(); edgeItr.hasNext();) {
                DataEdge edge = edgeItr.next();
                DataPort toPort = edge.getToPort();
                toPort.removeEdge(edge);
                edgeItr.remove();
                this.edges.remove(edge);
                toPort.getNode().edgeWasRemoved(edge);
            }
            portItr.remove();

View Full Code Here

0 1 2 3 4 5 6

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.