DiaDes
0.1
DIAgnosis of Discrete-Event System
|
#include <list>
#include <diades/graph/GraphGen.hh>
#include <diades/graph/EdgeData.hh>
#include <diades/graph/NodeData.hh>
#include <diades/graph/Edge.hh>
#include <diades/graph/Node.hh>
Go to the source code of this file.
Classes | |
struct | Diades::Graph::GraphIterator< Any > |
class | Diades::Graph::Graph |
Namespaces | |
Diades | |
Namespace of the Diades project. | |
Diades::Graph | |
Namespace of the Graph library (libGraph) | |
Typedefs | |
typedef GraphIterator< Node > | Diades::Graph::NodeIterator |
typedef GraphIterator< Edge > | Diades::Graph::EdgeIterator |
Functions | |
template<typename InputIterator > | |
void | Diades::Graph::deleteEdge (Graph &g, InputIterator first, InputIterator last) |
template<typename InputIterator > | |
void | Diades::Graph::deleteNode (Graph &g, InputIterator first, InputIterator last) |
template<typename InputIterator , typename Predicate > | |
void | Diades::Graph::deleteNode (Graph &g, InputIterator first, InputIterator last, Predicate pred) |