java.lang.Object

com.ibm.wala.util.graph.impl.BasicOrderedMultiGraph<T>

Type Parameters:: T - type of node in the graph

All Implemented Interfaces:: EdgeManager<T>, Graph<T>, NodeManager<T>, OrderedMultiGraph<T>, Iterable<T>

public class BasicOrderedMultiGraph<T> extends Object implements OrderedMultiGraph<T>

Inefficient implementation of OrderedMultiGraph. UNDER CONSTRUCTION.

Constructor Summary

Constructors

Constructor

Description

BasicOrderedMultiGraph()
Method Summary

Modifier and Type

Method

Description

void

addEdge(int i, T src, T dst)

add an edge and record it so dst is the ith successor of src

void

addEdge(T src, T dst)

Add this edge, unconditionally setting it as the next successor.

void

addNode(T n)

add a node to this graph

boolean

containsNode(T N)

int

getNumberOfNodes()

int

getPredNodeCount(T N)

Return the number of immediate predecessor nodes of n

Iterator<T>

getPredNodes(T N)

For now, this returns nodes in no particular order! Fix this when needed.

T

getSuccessor(T node, int i)

get the ith successor of a node

int

getSuccNodeCount(T N)

Return the number of immediate successor nodes of this Node in the Graph

Iterator<T>

getSuccNodes(T N)

Return an Iterator over the immediate successor nodes of n

boolean

hasEdge(T src, T dst)

Iterator<T>

iterator()

void

removeAllIncidentEdges(T node)

void

removeEdge(T src, T dst)

void

removeIncomingEdges(T node)

void

removeNode(T n)

remove a node from this graph

void

removeNodeAndEdges(T N)

remove a node and all its incident edges

void

removeOutgoingEdges(T node)

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.lang.Iterable
forEach, spliterator

Constructor Details
- BasicOrderedMultiGraph
  
  public BasicOrderedMultiGraph()
Method Details
- addEdge
  
  public void addEdge(T src, T dst) throws IllegalArgumentException
  
  Add this edge, unconditionally setting it as the next successor.
  
  Specified by:
  
  addEdge in interface EdgeManager<T>
  
  Throws:
  
  IllegalArgumentException
- addEdge
  
  public void addEdge(int i, T src, T dst) throws IllegalArgumentException
  
  Description copied from interface: OrderedMultiGraph
  
  add an edge and record it so dst is the ith successor of src
  
  Specified by:
  
  addEdge in interface OrderedMultiGraph<T>
  
  Throws:
  
  IllegalArgumentException
- addNode
  
  public void addNode(T n)
  
  Description copied from interface: NodeManager
  
  add a node to this graph
  
  Specified by:
  
  addNode in interface NodeManager<T>
- containsNode
  
  public boolean containsNode(T N)
  
  Specified by:
  
  containsNode in interface NodeManager<T>
  
  Returns:
  
  true iff the graph contains the specified node
- getNumberOfNodes
  
  public int getNumberOfNodes()
  
  Specified by:
  
  getNumberOfNodes in interface NodeManager<T>
  
  Returns:
  
  the number of nodes in this graph
- getPredNodeCount
  
  public int getPredNodeCount(T N) throws IllegalArgumentException
  
  Description copied from interface: EdgeManager
  
  Return the number of immediate predecessor nodes of n
  
  Specified by:
  
  getPredNodeCount in interface EdgeManager<T>
  
  Returns:
  
  the number of immediate predecessors of n.
  
  Throws:
  
  IllegalArgumentException
- getPredNodes
  
  public Iterator<T> getPredNodes(T N) throws IllegalArgumentException
  
  For now, this returns nodes in no particular order! Fix this when needed.
  
  Specified by:
  
  getPredNodes in interface EdgeManager<T>
  
  Returns:
  
  an Iterator over the immediate predecessor nodes of this Node.
  
  Throws:
  
  IllegalArgumentException
- getSuccNodeCount
  
  public int getSuccNodeCount(T N) throws IllegalArgumentException
  
  Description copied from interface: EdgeManager
  
  Return the number of immediate successor nodes of this Node in the Graph
  
  Specified by:
  
  getSuccNodeCount in interface EdgeManager<T>
  
  Returns:
  
  the number of immediate successor Nodes of this Node in the Graph.
  
  Throws:
  
  IllegalArgumentException
- getSuccNodes
  
  public Iterator<T> getSuccNodes(T N) throws IllegalArgumentException
  
  Description copied from interface: EdgeManager
  
  Return an Iterator over the immediate successor nodes of n
  This method never returns null.
  
  Specified by:
  
  getSuccNodes in interface EdgeManager<T>
  
  Returns:
  
  an Iterator over the immediate successor nodes of n
  
  Throws:
  
  IllegalArgumentException
- hasEdge
  
  public boolean hasEdge(T src, T dst)
  
  Specified by:
  
  hasEdge in interface EdgeManager<T>
- iterator
  
  public Iterator<T> iterator()
  
  Specified by:
  
  iterator in interface Iterable<T>
  
  Specified by:
  
  iterator in interface NodeManager<T>
  
  Returns:
  
  an Iterator of the nodes in this graph
- removeAllIncidentEdges
  
  public void removeAllIncidentEdges(T node) throws UnimplementedError
  
  Specified by:
  
  removeAllIncidentEdges in interface EdgeManager<T>
  
  Throws:
  
  UnimplementedError
- removeEdge
  
  public void removeEdge(T src, T dst) throws UnimplementedError
  
  Specified by:
  
  removeEdge in interface EdgeManager<T>
  
  Throws:
  
  UnimplementedError
- removeIncomingEdges
  
  public void removeIncomingEdges(T node) throws UnimplementedError
  
  Specified by:
  
  removeIncomingEdges in interface EdgeManager<T>
  
  Throws:
  
  UnimplementedError
- removeNode
  
  public void removeNode(T n) throws UnimplementedError
  
  Description copied from interface: NodeManager
  
  remove a node from this graph
  
  Specified by:
  
  removeNode in interface NodeManager<T>
  
  Throws:
  
  UnimplementedError
- removeNodeAndEdges
  
  public void removeNodeAndEdges(T N) throws UnimplementedError
  
  Description copied from interface: Graph
  
  remove a node and all its incident edges
  
  Specified by:
  
  removeNodeAndEdges in interface Graph<T>
  
  Throws:
  
  UnimplementedError
- removeOutgoingEdges
  
  public void removeOutgoingEdges(T node) throws UnimplementedError
  
  Specified by:
  
  removeOutgoingEdges in interface EdgeManager<T>
  
  Throws:
  
  UnimplementedError
- getSuccessor
  
  public T getSuccessor(T node, int i) throws IllegalArgumentException
  
  Description copied from interface: OrderedMultiGraph
  
  get the ith successor of a node
  
  Specified by:
  
  getSuccessor in interface OrderedMultiGraph<T>
  
  Throws:
  
  IllegalArgumentException

Class BasicOrderedMultiGraph<T>

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Methods inherited from interface java.lang.Iterable

Constructor Details

BasicOrderedMultiGraph

Method Details

addEdge

addEdge

addNode

containsNode

getNumberOfNodes

getPredNodeCount

getPredNodes

getSuccNodeCount

getSuccNodes

hasEdge

iterator

removeAllIncidentEdges

removeEdge

removeIncomingEdges

removeNode

removeNodeAndEdges

removeOutgoingEdges

getSuccessor