mln::util::graph Class Reference
[Graphes]


Public Types
typedef Graph< void >	category
typedef util::edge< E >	edge_t
	The type of an edge.
typedef std::set< edge_data_t >	edges_set_t
	A set to test the presence of a given edge.
typedef std::vector< edge_data_t >	edges_t
	The type of the set of edges.
typedef E	exact_t
typedef util::vertex< E >	vertex_t
	The type of a vertex.
typedef std::vector < vertex_data_t >	vertices_t
	The type of the set of vertices.

typedef mln::internal::edge_bkd_iterator < graph >	edge_bkd_iter
typedef mln::internal::edge_fwd_iterator < graph >	edge_fwd_iter
	Edge iterators.
typedef edge_fwd_iter	edge_iter

typedef mln::internal::edge_nbh_edge_bkd_iterator < graph >	edge_nbh_edge_bkd_iter
typedef mln::internal::edge_nbh_edge_fwd_iterator < graph >	edge_nbh_edge_fwd_iter
	Edge centered edge iterators.
typedef edge_nbh_edge_fwd_iter	edge_nbh_edge_iter

typedef mln::internal::vertex_bkd_iterator < graph >	vertex_bkd_iter
typedef mln::internal::vertex_fwd_iterator < graph >	vertex_fwd_iter
	Iterator types Vertex iterators.
typedef vertex_fwd_iter	vertex_iter

typedef mln::internal::vertex_nbh_edge_bkd_iterator < graph >	vertex_nbh_edge_bkd_iter
typedef mln::internal::vertex_nbh_edge_fwd_iterator < graph >	vertex_nbh_edge_fwd_iter
	Vertex centered edge iterators.
typedef vertex_nbh_edge_fwd_iter	vertex_nbh_edge_iter

typedef mln::internal::vertex_nbh_vertex_bkd_iterator < graph >	vertex_nbh_vertex_bkd_iter
typedef mln::internal::vertex_nbh_vertex_fwd_iterator < graph >	vertex_nbh_vertex_fwd_iter
	Vertex centered vertex iterators.
typedef vertex_nbh_vertex_fwd_iter	vertex_nbh_vertex_iter
Public Member Functions
const util::tracked_ptr < mln::internal::data< E > > &	data_hook_ () const
	Hook to data; for debugging purpose.
	graph (unsigned nvertices)
	Construct a graph with `nvertices` vertices.
	graph ()
bool	has_v (const vertex_id_t &id_v) const
	Check whether a vertex id `id_v` exists in the graph.
void	print_debug (std::ostream &ostr) const
	Print on `ostr` the graph.
edge_id_t	v_ith_nbh_edge (const vertex_id_t &id_v, unsigned i) const
	Returns the `i` th edge adjacent to the vertex `id_v`.
vertex_id_t	v_ith_nbh_vertex (const vertex_id_t &id_v, unsigned i) const
	Returns the `i` th vertex adjacent to the vertex `id_v`.
size_t	v_nmax () const
	Return the number of vertices in the graph.
size_t	v_nmax_nbh_edges (const vertex_id_t &id_v) const
	Return the number of adjacent edges of vertex `id_v`.
size_t	v_nmax_nbh_vertices (const vertex_id_t &id_v) const
	Return the number of adjacent vertices of vertex `id_v`.

edge_id_t	add_edge (const vertex_id_t &id_v1, const vertex_id_t &id_v2)
	Edge oriented.
edge_id_t	e_ith_nbh_edge (const edge_id_t &id_e, unsigned i) const
	Return the `i` th edge adjacent to the edge `id_e`.
size_t	e_nmax () const
	Return the number of edges in the graph.
size_t	e_nmax_nbh_edges (const edge_id_t &id_e) const
	Return the number max of adjacent edge, given an edge `id_e`.
edge_t	edge (const vertex_t &v1, const vertex_t &v2) const
	@}
edge_t	edge (const edge_id_t &e) const
	Return the edge whose id is e.
const std::vector < util::ord_pair< vertex_id_t > > &	edges () const
	Return the list of all edges.
bool	has_e (const edge_id_t &id_e) const
	Return whether `id_e` is in the graph.
template<typename G2>
bool	is_subgraph_of (const G2 &g) const
	Return whether this graph is a subgraph Return true if g and *this have the same graph_id.
vertex_id_t	v1 (const edge_id_t &id_e) const
	Return the first vertex associated to the edge `id_e`.
vertex_id_t	v2 (const edge_id_t &id_e) const
	Return the second vertex associated to edge `id_e`.

unsigned	add_vertex ()
	Vertex oriented.
std::pair< vertex_id_t, vertex_id_t >	add_vertices (unsigned n)
	Add `n` vertices to the graph.
vertex_t	vertex (vertex_id_t id_v) const
	Return the vertex whose id is v.

bool	has (const util::edge< E > &e) const
	Edge oriented methods Check whether an edge `e` exists in the graph.

bool	has (const util::vertex< E > &v) const
	Vertex oriented methods Check whether a vertex `v` exists in the graph.

const void *	id () const
	Misc.

void	invalidate ()
	Invalidate the graph.
bool	is_valid () const
	Return true if this graph is valid.
vertex_id_t	v_other (const edge_id_t &id_e, const vertex_id_t &id_v) const
	Vertex and edge oriented methods.
Protected Attributes
util::tracked_ptr < mln::internal::data< E > >	data_
	Internal data, sharable by several graphs.
Package Types
typedef super::edge_data_t	edge_data_t
	Internal edge data type.
typedef super::vertex_data_t	vertex_data_t
	Internal vertex data type.
Package Attributes
	__pad0__:graph_base<graph> super
	The super class.

mln::util::graph Class Reference [Graphes]

Public Types

Public Member Functions

Protected Attributes

Package Types

Package Attributes

Detailed Description

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

mln::util::graph Class Reference
[Graphes]