A digraph that supports loop identification. More...

Inheritance diagram for otawa::concept::DiGraphWithLoop:

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)

Private Member Functions
bool	isLoopHeader (Vertex &vertex)
	Test if the vertex is a loop header. More...

Detailed Description

A digraph that supports loop identification.

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

bool elm::concept::Collection< Vertex , E >::isEmpty ( void )

inherited

bool otawa::concept::DiGraphWithLoop::isLoopHeader ( Vertex & vertex )

private

Test if the vertex is a loop header.

bool otawa::concept::DiGraph::isSuccessorOf	(	Vertex &	succ,
		const Vertex &	ref
	)

inherited

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

Parameters

succ	Successor vertex.
ref	Reference vertex.

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

vertex Vertex to get the out degree.

const Vertex& otawa::concept::DiGraph::sinkOf ( Edge & edge )

inherited

Get the sink of the given edge.

Parameters

edge	Edge to get target of.

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