Public Types | Public Member Functions | List of all members
ecolab::BiDirectionalBitRep Class Reference

#include <netcomplexity.h>

Collaboration diagram for ecolab::BiDirectionalBitRep:
Collaboration graph

Public Types

typedef Rep_const_iterator< BiDirectionalBitRep > const_iterator
 

Public Member Functions

const_iterator begin () const
 
const_iterator end () const
 
 operator BitRep () const
 
 BiDirectionalBitRep (unsigned nodes=0, unsigned links=0)
 
 BiDirectionalBitRep (const Graph &x)
 
 BiDirectionalBitRep (const DiGraph &x)
 
 BiDirectionalBitRep (const BiDirectionalGraph &x)
 
 BiDirectionalBitRep (const NautyRep &x)
 
 BiDirectionalBitRep (const BitRep &x)
 
const BiDirectionalBitRep & operator= (const DiGraph &x)
 
const BiDirectionalBitRep & operator= (const BiDirectionalGraph &x)
 
const BiDirectionalBitRep & operator= (const NautyRep &x)
 
const BiDirectionalBitRep & operator= (const BitRep &x)
 
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 BiDirectionalBitRep &x) const
 
bool operator!= (const BiDirectionalBitRep &x) const
 
bool operator< (const BiDirectionalBitRep &x) const
 
bool contains (const Edge &e) const
 
void push_back (const Edge &e)
 
void clear (unsigned nodes=0)
 

Detailed Description

an undirected graph with the linklist represented by a bitvector

Constructor & Destructor Documentation

◆ BiDirectionalBitRep()

ecolab::BiDirectionalBitRep::BiDirectionalBitRep ( unsigned  nodes = 0,
unsigned  links = 0 
)
inline

generate a node graph with l links at start of bit sequence (eg 11111000000....)

References ecolab::asgRepGraph().

The documentation for this class was generated from the following file: