G
.
More...
#include <vertex.hh>
Public Types | |
typedef Vertex< void > | Category |
Object category. | |
typedef G | graph_t |
Graph associated type. | |
typedef vertex_id_t | id_t |
The vertex type id. | |
typedef vertex_id_t::value_t | id_value_t |
The underlying type used to store vertex ids. | |
Public Member Functions | |
void | change_graph (const G &g) |
Change the parent graph of that vertex. | |
edge< G > | edge_with (const vertex< G > &v_id) const |
Returns true if this vertex has an edge with the given vertex. | |
const G & | graph () const |
Returns the graph pointer this vertex belongs to. | |
const vertex_id_t & | id () const |
Returns the vertex id. | |
void | invalidate () |
Invalidate that vertex. | |
bool | is_valid () const |
Check whether the vertex is still part of the graph. | |
edge_id_t | ith_nbh_edge (unsigned i) const |
Returns the ith edge starting from this vertex. | |
vertex_id_t | ith_nbh_vertex (unsigned i) const |
Returns the ith vertex adjacent to this vertex. | |
unsigned | nmax_nbh_edges () const |
Returns the number max of edges starting from this vertex. | |
unsigned | nmax_nbh_vertices () const |
Returns the number max of vertices adjacent to this vertex. | |
operator vertex_id_t () const | |
Conversion to the vertex id. | |
vertex_id_t | other (const edge_id_t &id_e) const |
Returns the other vertex located on edge id_e . | |
void | update_id (const vertex_id_t &id) |
Update the vertex id. | |
vertex () | |
Constructors. |
G
. typedef Vertex<void> mln::util::vertex< G >::Category |
Object category.
typedef G mln::util::vertex< G >::graph_t |
Graph associated type.
typedef vertex_id_t mln::util::vertex< G >::id_t |
The vertex type id.
typedef vertex_id_t::value_t mln::util::vertex< G >::id_value_t |
The underlying type used to store vertex ids.
mln::util::vertex< G >::vertex | ( | ) | [inline] |
void mln::util::vertex< G >::change_graph | ( | const G & | g | ) | [inline] |
edge< G > mln::util::vertex< G >::edge_with | ( | const vertex< G > & | v_id | ) | const [inline] |
const G & mln::util::vertex< G >::graph | ( | ) | const [inline] |
Returns the graph pointer this vertex belongs to.
Referenced by mln::p_vertices< G, F >::has(), mln::util::line_graph< G >::has(), and mln::util::operator==().
const vertex_id_t & mln::util::vertex< G >::id | ( | ) | const [inline] |
Returns the vertex id.
Referenced by mln::util::graph::edge(), mln::util::line_graph< G >::has(), and mln::util::operator==().
void mln::util::vertex< G >::invalidate | ( | ) | [inline] |
bool mln::util::vertex< G >::is_valid | ( | ) | const [inline] |
edge_id_t mln::util::vertex< G >::ith_nbh_edge | ( | unsigned | i | ) | const [inline] |
vertex_id_t mln::util::vertex< G >::ith_nbh_vertex | ( | unsigned | i | ) | const [inline] |
unsigned mln::util::vertex< G >::nmax_nbh_edges | ( | ) | const [inline] |
unsigned mln::util::vertex< G >::nmax_nbh_vertices | ( | ) | const [inline] |
Returns the number max of vertices adjacent to this vertex.
mln::util::vertex< G >::operator vertex_id_t | ( | ) | const [inline] |
Conversion to the vertex id.
FIXME: May cause ambiguities... :(
vertex_id_t mln::util::vertex< G >::other | ( | const edge_id_t & | id_e | ) | const [inline] |
void mln::util::vertex< G >::update_id | ( | const vertex_id_t & | id | ) | [inline] |
Update the vertex id.