Graph (GWT 2.7.0)

Type Parameters:

NodeType - graph node type.

EdgeType - graph edge type.

TransformerType - transformer type. Transformer instances can be used to change the graph and its underlying representation to apply optimizations.

All Known Implementing Classes:

Cfg
```
public interface Graph<NodeType,EdgeType,TransformerType>
```
Directed graph abstraction for flow analysis. We specifically define all navigation methods in graph interface and do not ask nodes and edges to conform to any interface. This way graphs can be memory-efficient. The graph can have one or more incoming edges (i.e. edges, which end on some nodes in the graph, but originate somewhere outside the graph), and one or more outgoing edges.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method and Description
`Object`	`getEdgeData(EdgeType edge)`
`NodeType`	`getEnd(EdgeType edge)` Returns edge end node.
`ArrayList<EdgeType>`	`getGraphInEdges()` Returns graph incoming edges.
`ArrayList<EdgeType>`	`getGraphOutEdges()` Returns graph outgoing edges.
`List<EdgeType>`	`getInEdges(NodeType n)` Returns edges coming into node.
`ArrayList<NodeType>`	`getNodes()` Returns all nodes in the graph.
`List<EdgeType>`	`getOutEdges(NodeType node)` Returns edges originating from the node.
`NodeType`	`getStart(EdgeType edge)` Returns edge start node.
`String`	`print()` Returns string representation of the graph.
`<A extends Assumption<A>> String`	`printWithAssumptions(Map<EdgeType,A> assumptions)` Returns string representation of the graph with all assumptions along its edges.
`void`	`setEdgeData(EdgeType edge, Object data)`
`boolean`	`transform(NodeType node, TransformerType transformer)` Transforms the node with transformer.

- Method Detail
  - getEdgeData
```
Object getEdgeData(EdgeType edge)
```
  - getEnd
```
NodeType getEnd(EdgeType edge)
```
    Returns edge end node.
  - getGraphInEdges
```
ArrayList<EdgeType> getGraphInEdges()
```
    Returns graph incoming edges.
  - getGraphOutEdges
```
ArrayList<EdgeType> getGraphOutEdges()
```
    Returns graph outgoing edges.
  - getInEdges
```
List<EdgeType> getInEdges(NodeType n)
```
    Returns edges coming into node.
  - getNodes
```
ArrayList<NodeType> getNodes()
```
    Returns all nodes in the graph.
  - getOutEdges
```
List<EdgeType> getOutEdges(NodeType node)
```
    Returns edges originating from the node.
  - getStart
```
NodeType getStart(EdgeType edge)
```
    Returns edge start node.
  - print
```
String print()
```
    Returns string representation of the graph.
  - printWithAssumptions
```
<A extends Assumption<A>> String printWithAssumptions(Map<EdgeType,A> assumptions)
```
    Returns string representation of the graph with all assumptions along its edges.
  - setEdgeData
```
void setEdgeData(EdgeType edge,
                 Object data)
```
  - transform
```
boolean transform(NodeType node,
                  TransformerType transformer)
```
    Transforms the node with transformer. This will be called by solver to apply optimizations.
    
    Returns:
    
    true if there were changes made by transformer. While transformation should be always sound, it might be impossible to apply it in current context due to complexities of underlying structures. E.g. it is impossible to delete if statement test expression, while it is not evaluated if statement is not reachable. In this case transformer can return false and do no changes.

Interface Graph<NodeType,EdgeType,TransformerType>

Method Summary

Method Detail

getEdgeData

getEnd

getGraphInEdges

getGraphOutEdges

getInEdges

getNodes

getOutEdges

getStart

print

printWithAssumptions

setEdgeData

transform