Directed Acyclic Graph. More...
#include <dag.h>
Public Member Functions | |
virtual | ~DAG (void) throw () |
virtual void | addNode (const char *node)=0 |
virtual void | addEdge (const char *from_node, const char *to_node)=0 |
virtual void | getOrderedNodeList (VecString &leaf_to_root) const =0 |
Static Public Member Functions | |
static smart_ptr< DAG > | create (void) |
Directed Acyclic Graph.
Note that this supports only a few operations I added because I needed them. In fact, it is pretty much only useful for dependency analysis.
Definition at line 55 of file dag.h.
virtual void graph::DAG::addNode | ( | const char * | node | ) | [pure virtual] |
virtual void graph::DAG::addEdge | ( | const char * | from_node, | |
const char * | to_node | |||
) | [pure virtual] |
virtual void graph::DAG::getOrderedNodeList | ( | VecString & | leaf_to_root | ) | const [pure virtual] |