OTAWA provides several graph implementations and algorithm to use them. More...

Classes
class	otawa::graph::PreorderIterator< G >
	An iterator allowing to traverse the graph using preorder, that is, a node is only traversed when its predecessors has been traversed. More...

class	otawa::graph::Graph
	This class represents a full graph with nodes and edges. More...

Detailed Description

OTAWA provides several graph implementations and algorithm to use them.

A graph is OTAWA-compliant if it implements the otawa::concept::DiGraph concept and any provided algorithm may be applied to it.

The graph implements includes:

The following algorithm are provided:

Classes