$extrastylesheet
#include <mln/util/internal/graph_base.hh>
Public Member Functions | |
const util::tracked_ptr < mln::internal::data< E > > & | data_hook_ () const |
void | print_debug (std::ostream &ostr) const |
const void * | id () const |
bool | has (const util::vertex< E > &v) const |
bool | has (const util::edge< E > &e) const |
vertex_id_t | v_other (const edge_id_t &id_e, const vertex_id_t &id_v) const |
bool | is_valid () const |
void | invalidate () |
Protected Member Functions | |
graph_base () |
Protected Attributes | |
util::tracked_ptr < mln::internal::data< E > > | data_ |
Public Types | |
typedef Graph< void > | category |
typedef ord_pair< vertex_id_t > | edge_data_t |
typedef util::edge< E > | edge_t |
typedef E | exact_t |
typedef std::vector< edge_id_t > | vertex_data_t |
typedef util::vertex< E > | vertex_t |
Definition at line 68 of file graph_base.hh.
|
protected |
Constructor.
const util::tracked_ptr< mln::internal::data<E> >& mln::util::internal::graph_base< E >::data_hook_ | ( | ) | const |
Hook to data; for debugging purpose.
bool mln::util::internal::graph_base< E >::has | ( | const util::vertex< E > & | v | ) | const |
Vertex oriented methodsCheck whether a vertex v
exists in the graph.
bool mln::util::internal::graph_base< E >::has | ( | const util::edge< E > & | e | ) | const |
Edge oriented methodsCheck whether an edge e
exists in the graph.
const void* mln::util::internal::graph_base< E >::id | ( | ) | const |
Misc.
methods
Returns the graph id, the "this" pointer.
void mln::util::internal::graph_base< E >::invalidate | ( | ) |
Invalidate the graph.
bool mln::util::internal::graph_base< E >::is_valid | ( | ) | const |
Return true if this graph is valid.
void mln::util::internal::graph_base< E >::print_debug | ( | std::ostream & | ostr | ) | const |
Print on ostr
the graph.
[in] | ostr | The output stream. |
vertex_id_t mln::util::internal::graph_base< E >::v_other | ( | const edge_id_t & | id_e, |
const vertex_id_t & | id_v | ||
) | const |
Vertex and edge oriented methods.
Returns the other adjacent vertex id of a given edge id id_e
.
|
protected |
Internal data, sharable by several graphs.
Definition at line 129 of file graph_base.hh.
|
inherited |
Definition at line 62 of file core/concept/graph.hh.
typedef ord_pair<vertex_id_t> mln::util::internal::graph_base< E >::edge_data_t |
Internal edge data type.
Definition at line 81 of file graph_base.hh.
typedef util::edge<E> mln::util::internal::graph_base< E >::edge_t |
The type of an edge.
Definition at line 75 of file graph_base.hh.
|
inherited |
typedef std::vector<edge_id_t> mln::util::internal::graph_base< E >::vertex_data_t |
Internal vertex data type.
Definition at line 78 of file graph_base.hh.
typedef util::vertex<E> mln::util::internal::graph_base< E >::vertex_t |
The type of a vertex.
Definition at line 73 of file graph_base.hh.