Directed Acyclic Graph. More...
#include <dag.h>
Inheritance diagram for graph::DAG:
Public Member Functions | |
| virtual | ~DAG (void) throw () |
| virtual void | addNode (IN const char *node)=0 |
| virtual void | addEdge (IN const char *from_node, IN const char *to_node)=0 |
| virtual void | getOrderedNodeList (OUT VecString &leaf_to_root) const =0 |
Static Public Member Functions | |
| static smart_ptr< DAG > | create (void) |
Detailed Description
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.
Constructor & Destructor Documentation
Member Function Documentation
| virtual void graph::DAG::addNode | ( | IN const char * | node | ) | [pure virtual] |
| virtual void graph::DAG::addEdge | ( | IN const char * | from_node, | |
| IN const char * | to_node | |||
| ) | [pure virtual] |
| virtual void graph::DAG::getOrderedNodeList | ( | OUT VecString & | leaf_to_root | ) | const [pure virtual] |
The documentation for this class was generated from the following files:
