#include <adj_list.h>
Public Types | |
typedef pair< int, EDGE_T > | EDGE_P |
typedef vector< EDGE_P, ALLOC< EDGE_P > > | EDGES |
typedef EDGES::iterator | EIT |
typedef EDGES::const_iterator | CONST_EIT |
Public Member Functions | |
vertex_info (const VERTEX_T &vert, const int &idval) | |
EIT | out_begin () |
Returns an iterator pointing to the begining of the list of out_edges. | |
CONST_EIT | out_begin () const |
Returns a const_iterator pointing to the begining of the list of out_edges. | |
EIT | out_end () |
Returns an iterator pointing to the end of the list of out_edges. | |
CONST_EIT | out_end () const |
Returns a const_iterator pointing to the end of the list of out_edges. | |
EIT | in_begin () |
Returns an iterator pointing to the begining of the list of in_edges. | |
CONST_EIT | in_begin () const |
Returns a cont_iterator pointing to the begining of the list of in_edges. | |
EIT | in_end () |
Returns an iterator pointing to the end of the list of in_edges. | |
CONST_EIT | in_end () const |
Returns a const_iterator pointing to the end of the list of in_edges. | |
void | add_out_edge (const int &dest, const EDGE_T &e) |
Adds an out_edge to the list of the out_edges. | |
void | add_in_edge (const int &src, const EDGE_T &e) |
Adds an out_edge to the list of the out_edges. | |
bool | out_edge (const int &dest, EDGE_T &e) const |
bool | in_edge (const int &src, EDGE_T &e) const |
bool | operator< (const vertex_info< VERTEX_T, EDGE_T, ALLOC > &vertex2) const |
Returns true if this vertex is less than vertex2. | |
Public Attributes | |
VERTEX_T | v |
data members /// | |
int | id |
EDGES | out_edges |
EDGES | in_edges |
Friends | |
ostream & | operator<< (ostream &, const vertex_info< VERTEX_T, EDGE_T, ALLOC > &) |
Outputs a vertex_info object to the stream. This is a global function, not a member function. |
bool vertex_info< VERTEX_T, EDGE_T, ALLOC >::in_edge | ( | const int & | src, | |
EDGE_T & | e | |||
) | const [inline] |
Returns true if there exists an in-edge from src to this vertex and populates edge label in e
bool vertex_info< VERTEX_T, EDGE_T, ALLOC >::out_edge | ( | const int & | dest, | |
EDGE_T & | e | |||
) | const [inline] |
Returns true if there exists an out-edge from this vertex to dest and populates edge label in e