Otawa
0.10
|
#include <elm/assert.h>
#include <elm/PreIterator.h>
#include <elm/genstruct/FragTable.h>
#include <elm/util/BitVector.h>
#include <elm/genstruct/VectorQueue.h>
Go to the source code of this file.
Classes | |
class | otawa::graph::Node |
The node from a directed graph. More... | |
class | otawa::graph::Node::Successor |
This class allows to iterates on the successors of a node. More... | |
class | otawa::graph::Node::Predecessor |
This class allows to iterates on the predecessors of a node. More... | |
class | otawa::graph::Edge |
This class represents a directed edge between two nodes. More... | |
class | otawa::graph::Graph |
This class represents a full graph with nodes and edges. More... | |
class | otawa::graph::Graph::Iterator |
A simple iterator on the nodes contained in a graph. More... | |
class | otawa::graph::Graph::OutIterator |
class | otawa::graph::Graph::InIterator |
Namespaces | |
otawa | |
$Id$ Copyright (c) 2007, IRIT - UPS casse @iri t.fr | |
otawa::graph | |