#include <rm3_simple_graph.h>
Public Member Functions | |
simple_graph () | |
~simple_graph () | |
simple_graph (undi_graph &G) | |
node | new_node (int id=-1) |
edge | new_edge (node n1, node n2, int id=-1) |
void | del_node (node &n) |
void | del_edge (edge &e) |
int | number_of_nodes () const |
int | number_of_edges () const |
void | contract (edge &, node) |
bool | is_empty () |
Public Attributes | |
gdt::gdtlist< node > | _nodes |
gdt::gdtlist< edge > | _edges |
Friends | |
class | undi_graph |
Definition at line 128 of file rm3_simple_graph.h.
simple_graph::simple_graph | ( | ) |
simple_graph::~simple_graph | ( | ) |
simple_graph::simple_graph | ( | undi_graph & | G | ) |
void simple_graph::del_node | ( | node & | n | ) |
void simple_graph::del_edge | ( | edge & | e | ) |
int simple_graph::number_of_nodes | ( | ) | const |
int simple_graph::number_of_edges | ( | ) | const |
bool simple_graph::is_empty | ( | ) |
friend class undi_graph [friend] |
Definition at line 131 of file rm3_simple_graph.h.
Definition at line 141 of file rm3_simple_graph.h.
Definition at line 142 of file rm3_simple_graph.h.