5 #include <libutl/TCollection.h> 6 #include <libutl/RBtree.h> 7 #include <libutl/Vertex.h> 46 Graph(
bool owner,
bool directed =
true)
48 setCollection(
new RBtree(owner));
50 setDirected(directed);
69 return getFlag(flg_directed);
76 setFlag(flg_directed, directed);
102 bool addEdge(
const Object& lhsKey,
const Object& rhsKey);
110 bool removeEdge(
const Object& lhsKey,
const Object& rhsKey);
120 setCollection(
new RBtree(
true));
void setDirected(bool directed)
Set the directed flag.
void serialize(bool &b, Stream &stream, uint_t io, uint_t mode=ser_default)
Serialize a boolean.
void setStart(Vertex *start)
Set the start vertex.
void deInit()
De-initialize UTL++.
default representation (via getSerializeMode())
#define UTL_CLASS_DECL(DC, BC)
Declaration of standard UTL++ functionality for a non-template class.
Mix-in to provide 64-bits for space-efficient storage of up to 64 boolean flags.
Graph (directed or undirected).
Templated proxy for Collection.
void clear()
Remove all vertices, clear the start vertex.
unsigned int uint_t
Unsigned integer.
Vertex * getStart() const
Return the start vertex.
Root of UTL++ class hierarchy.
void init()
Initialize UTL++.
Graph(bool owner, bool directed=true)
Constructor.
bool isDirected() const
Get the directed flag.