Otawa  0.10
otawa::concept::BiDiGraph Class Reference

Concept of directed graph with predecessor available. More...

#include </home/casse/otawa/otawa/src/prog/concepts.h>

Inheritance diagram for otawa::concept::BiDiGraph:
otawa::concept::DiGraph elm::concept::Collection< Vertex > otawa::concept::DiGraphWithExit

Classes

class  Predecessor
 Entering-in edge iterator on a node. More...
 

Public Member Functions

const VertexsinkOf (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)
 

Private Member Functions

const VertexsourceOf (const Edge &edge)
 Get the source of the given edge. More...
 
int inDegree (const Vertex &vertex) const
 Get the output degree of the vertex. More...
 
bool isSuccessorOf (const Vertex &succ, const Vertex &ref)
 Test if the pred vertex is predecessor of the ref vertex. More...
 

Detailed Description

Concept of directed graph with predecessor available.

Member Function Documentation

bool elm::concept::Collection< Vertex , E >::contains ( const Vertex &  item)
inherited
bool elm::concept::Collection< Vertex , E >::containsAll ( const C< Vertex > &  collection)
inherited
int elm::concept::Collection< Vertex , E >::count ( void  )
inherited
int otawa::concept::BiDiGraph::inDegree ( const Vertex vertex) const
private

Get the output degree of the vertex.

Parameters
vertexVertex to get the out degree.
Returns
In degree.
bool elm::concept::Collection< Vertex , E >::isEmpty ( void  )
inherited
bool otawa::concept::DiGraph::isSuccessorOf ( Vertex succ,
const Vertex ref 
)
inherited

Test if the succ vertex is successor of the ref vertex.

Parameters
succSuccessor vertex.
refReference vertex.
Returns
True if succ is successor of ref.
bool otawa::concept::BiDiGraph::isSuccessorOf ( const Vertex succ,
const Vertex ref 
)
private

Test if the pred vertex is predecessor of the ref vertex.

Parameters
predPredecessor vertex.
refReference vertex.
Returns
True if pred is predecessor of ref.
elm::concept::Collection< Vertex , E >::operator bool ( void  )
inherited
int otawa::concept::DiGraph::outDegree ( const Vertex vertex) const
inherited

Get the output degree of the vertex.

Parameters
vertexVertex to get the out degree.
Returns
Out degreee.
const Vertex& otawa::concept::DiGraph::sinkOf ( Edge edge)
inherited

Get the sink of the given edge.

Parameters
edgeEdge to get target of.
Returns
Sink of the given edge.
const Vertex& otawa::concept::BiDiGraph::sourceOf ( const Edge edge)
private

Get the source of the given edge.

Parameters
edgeEdge to get target of.
Returns
Source of the given edge.

The documentation for this class was generated from the following file: