A graph in which each link is bidirectional. More...
#include <graph.h>
Public Types | |
typedef BiDirectionalGraph_const_iterator | const_iterator |
typedef const_iterator | iterator |
Public Member Functions | |
const_iterator | begin () const |
const_iterator | end () const |
void | push_back (Edge e) |
void | clear (unsigned nodes=0) |
BiDirectionalGraph (unsigned nodes=0) | |
template<class G > | |
BiDirectionalGraph (const G &g) | |
initialise Graph using Graph "duck-typed" object | |
template<class G > | |
const BiDirectionalGraph & | operator= (const G &g) |
unsigned | nodes () const |
unsigned | links () const |
bool | contains (Edge e) const |
void | swap (BiDirectionalGraph &g) |
bool | operator== (const BiDirectionalGraph &x) const |
bool | operator!= (const BiDirectionalGraph &x) const |
bool | operator< (const BiDirectionalGraph &x) const |
A graph in which each link is bidirectional.