|
| ConcreteGraph (unsigned nodes=0) |
|
template<class H > |
| ConcreteGraph (const H &g1) |
|
bool | operator== (const ConcreteGraph &x) |
|
bool | operator!= (const ConcreteGraph &x) |
|
| GraphAdaptor (G &g) |
|
const GraphAdaptor & | operator= (const GraphAdaptor &x) |
|
Graph::const_iterator | begin () const |
| iterator to first edge
|
|
Graph::const_iterator | end () const |
| iterator beyond last edge
|
|
unsigned | nodes () const |
| number of nodes
|
|
unsigned | links () const |
| number of links
|
|
bool | contains (const Edge &e) const |
| true if graph contains e
|
|
bool | directed () const |
| true if a bidirectional graph (all edges go both ways)
|
|
void | push_back (const Edge &e) |
| add an edge. Node count is adjusted so that edge is valid.
|
|
void | clear (unsigned nodes=0) |
| remove all edges from the graph and set the node count
|
|
template<> |
bool | directed () const |
| true if a bidirectional graph (all edges go both ways)
|
|
template<> |
bool | directed () const |
| true if a bidirectional graph (all edges go both ways)
|
|
template<class BG > |
void | push_back (const typename BG::edge_iterator::value_type &e) |
| support for Boost Graph Library
|
|
void | Clear (TCL_args args) |
|
const Graph & | operator= (const Graph &x) |
|
template<class BG > |
Graph_back_insert_iterator< Graph, BG > | back_inserter (const BG &bg) |
|
void | input (const std::string &format, const std::string &filename) |
| available formats pajek, lgl, dot, gengraph (input only)
|
|
void | output (const std::string &format, const std::string &filename) const |
|
|
typedef Edge | value_type |
|
typedef std::size_t | size_type |
|
typedef std::ptrdiff_t | difference_type |
|
typedef Edge & | reference |
|
typedef const Edge & | const_reference |
|
The documentation for this class was generated from the following file: