Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
  /* Soot - a J*va Optimization Framework
   * Copyright (C) 2007 Richard L. Halpert
   *
   * This library is free software; you can redistribute it and/or
   * modify it under the terms of the GNU Lesser General Public
   * License as published by the Free Software Foundation; either
   * version 2.1 of the License, or (at your option) any later version.
   *
   * This library is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  * Lesser General Public License for more details.
  *
  * You should have received a copy of the GNU Lesser General Public
  * License along with this library; if not, write to the
  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  * Boston, MA 02111-1307, USA.
  */
 
 /*
  * Modified by the Sable Research Group and others 1997-1999.  
  * See the 'credits' file distributed with Soot for the complete list of
  * contributors.  (Soot is distributed at http://www.sable.mcgill.ca/soot)
  */
 
 
 package soot.toolkits.graph;
 
 import java.util.*;



Defines a DirectedGraph which is modifiable and associates a label object with every edge. Provides an interface to add/delete nodes and edges.
 
 
 public interface MutableEdgeLabelledDirectedGraph extends DirectedGraph
 {
    
Adds an edge to the graph between 2 nodes. If the edge is already present no change is made.

Parameters:
from out node for the edge.
to in node for the edge.
label label for the edge.
 
     public void addEdge(Object fromObject toObject label);


    
Returns a list of labels for which an edge exists between from and to

Parameters:
from out node for the edges to remove.
to in node for the edges to remove.
 
     public List<ObjectgetLabelsForEdges(Object fromObject to);


    
Returns a MutableDirectedGraph consisting of all edges with the given label and their nodes. Nodes without edges are not included in the new graph.

Parameters:
label label for the edge to remove.
 
 	public MutableDirectedGraph getEdgesForLabel(Object label);


    
Removes an edge between 2 nodes in the graph. If the edge is not present no change is made.

Parameters:
from out node for the edges to remove.
to in node for the edges to remove.
label label for the edge to remove.
 
     public void removeEdge(Object fromObject toObject label);
    
    
    
Removes all edges between 2 nodes in the graph. If no edges are present, no change is made.

Parameters:
from out node for the edges to remove.
to in node for the edges to remove.
 
     public void removeAllEdges(Object fromObject to);
    
    
    
Removes all edges with the given label in the graph. If no edges are present, no change is made.

Parameters:
label label for the edge to remove.
 
     public void removeAllEdges(Object label);


    

Returns:
true if the graph contains an edge between the 2 nodes with the given label, otherwise return false.
  
     public boolean containsEdge(Object fromObject toObject label);
    
    
    

Parameters:
from out node for the edges.
to in node for the edges.
Returns:
true if the graph contains any edges between the 2 nodes, otherwise return false.
 
    public boolean containsAnyEdge(Object fromObject to);
    
    
    

Parameters:
label label for the edges.
Returns:
true if the graph contains any edges with the given label, otherwise return false.
 
    public boolean containsAnyEdge(Object label);


    

Returns:
a list of the nodes that compose the graph. No ordering is implied
    public List<ObjectgetNodes();


    
Adds a node to the graph. Initially the added node has no successors or predecessors. ; as a consequence it is considered both a head and tail for the graph.

Parameters:
node a node to add to the graph.
See also:
DirectedGraph.getHeads()
DirectedGraph.getTails()
    public void addNode(Object node);


    
Removes a node from the graph. If the node is not found in the graph, no change is made.

Parameters:
node the node to be removed.
    public void removeNode(Object node);


    

Parameters:
node node that we want to know if the graph constains.
Returns:
true if the graph contains the node. false otherwise.
    public boolean containsNode(Object node);
}

 





New to GrepCode? Check out our FAQ X