public class DominatorTreeAdapter extends java.lang.Object implements DirectedGraph
This might be useful if e.g. you want to apply a DirectedGraph analysis such as the PseudoTopologicalOrderer to a DominatorTree.
| Constructor and Description |
|---|
DominatorTreeAdapter(DominatorTree dt) |
| Modifier and Type | Method and Description |
|---|---|
java.util.List |
getHeads()
Returns a list of entry points for this graph.
|
java.util.List |
getPredsOf(java.lang.Object node)
Returns a list of predecessors for the given node in the graph.
|
java.util.List |
getSuccsOf(java.lang.Object node)
Returns a list of successors for the given node in the graph.
|
java.util.List |
getTails()
Returns a list of exit points for this graph.
|
java.util.Iterator |
iterator()
Returns an iterator for the nodes in this graph.
|
int |
size()
Returns the node count for this graph.
|
public DominatorTreeAdapter(DominatorTree dt)
public java.util.List getHeads()
DirectedGraphgetHeads in interface DirectedGraphpublic java.util.List getTails()
DirectedGraphgetTails in interface DirectedGraphpublic java.util.List getPredsOf(java.lang.Object node)
DirectedGraphgetPredsOf in interface DirectedGraphpublic java.util.List getSuccsOf(java.lang.Object node)
DirectedGraphgetSuccsOf in interface DirectedGraphpublic java.util.Iterator iterator()
DirectedGraphiterator in interface java.lang.Iterableiterator in interface DirectedGraphpublic int size()
DirectedGraphsize in interface DirectedGraphCopyright © 2012-2019 RoboVM AB. All Rights Reserved.