Otawa
0.10
|
Concept of directed graph providing an edge map. More...
#include </home/casse/otawa/otawa/src/prog/concepts.h>
Classes | |
class | EdgeMap |
Efficient map for the edges. More... | |
Public Member Functions | |
const Vertex & | sinkOf (Edge &edge) |
Get the sink of the given edge. More... | |
int | outDegree (const Vertex &vertex) const |
Get the output degree of the vertex. More... | |
bool | isSuccessorOf (Vertex &succ, const Vertex &ref) |
Test if the succ vertex is successor of the ref vertex. More... | |
int | count (void) |
bool | contains (const Vertex &item) |
bool | containsAll (const C< Vertex > &collection) |
bool | isEmpty (void) |
operator bool (void) | |
Concept of directed graph providing an edge map.
|
inherited |
|
inherited |
|
inherited |
|
inherited |
Test if the succ vertex is successor of the ref vertex.
succ | Successor vertex. |
ref | Reference vertex. |
|
inherited |
|
inherited |
Get the output degree of the vertex.
vertex | Vertex to get the out degree. |
Get the sink of the given edge.
edge | Edge to get target of. |