#include <netcomplexity.h>
Public Types | |
typedef Rep_const_iterator< BitRep > | const_iterator |
Public Member Functions | |
const_iterator | begin () const |
const_iterator | end () const |
BitRep (unsigned nodes=0, unsigned links=0) | |
BitRep (const Graph &x) | |
BitRep (const DiGraph &x) | |
BitRep (const BiDirectionalGraph &x) | |
BitRep (const NautyRep &x) | |
BitRep (const BiDirectionalBitRep &x) | |
const BitRep & | operator= (const DiGraph &x) |
const BitRep & | operator= (const BiDirectionalGraph &x) |
const BitRep & | operator= (const NautyRep &x) |
const BitRep & | operator= (const BiDirectionalBitRep &x) |
const BitRep & | operator|= (const BitRep &x) |
BitRep | operator| (BitRep x) const |
const BitRep & | operator &= (const BitRep &x) |
BitRep | operator & (BitRep x) const |
const BitRep & | operator^= (const BitRep &x) |
BitRep | operator^ (BitRep x) const |
BitRep | operator~ () const |
BitRep | operator+= (const BitRep &x) |
BiDirectionalBitRep | symmetrise () |
bitref | operator() (unsigned i, unsigned j) |
const_bitref | operator() (unsigned i, unsigned j) const |
unsigned | nodes () const |
number of nodes this graph has | |
unsigned | links () const |
number of links this graph has | |
bool | next_perm () |
next permutation of links - returns false if no further permutations | |
bool | operator== (const BitRep &x) const |
bool | operator!= (const BitRep &x) const |
bool | operator< (const BitRep &x) const |
bool | contains (const Edge &e) const |
void | push_back (const Edge &e) |
void | clear (unsigned nodes=0) |
a directed graph with the linklist represented by a bitvector
|
inline |
generate a node graph with l links at start of bit sequence (eg 11111000000....)
References ecolab::asgRepGraph().