LRDE Tiger Compiler  1.34a $Id: 7fef12e1f5fa43449d667a0eec1d837c40fc1202 $
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
misc::undirected_graph< VertexLabel, EdgeLabel > Class Template Reference

#include <graph.hh>

Inheritance diagram for misc::undirected_graph< VertexLabel, EdgeLabel >:
Collaboration diagram for misc::undirected_graph< VertexLabel, EdgeLabel >:

Public Types

typedef graph
< boost::undirectedS,
VertexLabel, EdgeLabel > 
super_type
typedef
super_type::vertex_descriptor 
vertex_descriptor
typedef graph
< boost::undirectedS,
VertexLabel, EdgeLabel > 
self_type
typedef boost::graph_traits
< self_type >::vertex_iterator 
vertex_iter_type
 Iterators.
typedef boost::graph_traits
< self_type >::edge_iterator 
edge_iter_type
 Iterator on the edges of a graph.

Public Member Functions

virtual ~undirected_graph ()
virtual void edge_add (const vertex_descriptor &v1, const vertex_descriptor &v2) override
 Add an edge between two vertices.
vertex_descriptor vertex_add (const VertexLabel &l)
 Add a vertex to the graph.
virtual std::ostream & print (std::ostream &ostr) const
virtual void print (std::string file) const
virtual std::ostream & epilogue_print (std::ostream &ostr) const
const std::string & name_get () const
void name_set (const std::string &name)

Member Typedef Documentation

typedef boost::graph_traits<self_type>::edge_iterator misc::graph< boost::undirectedS , VertexLabel, EdgeLabel >::edge_iter_type
inherited

Iterator on the edges of a graph.

typedef graph<boost::undirectedS , VertexLabel, EdgeLabel> misc::graph< boost::undirectedS , VertexLabel, EdgeLabel >::self_type
inherited
template<typename VertexLabel = empty, typename EdgeLabel = empty>
typedef graph<boost::undirectedS, VertexLabel, EdgeLabel> misc::undirected_graph< VertexLabel, EdgeLabel >::super_type
template<typename VertexLabel = empty, typename EdgeLabel = empty>
typedef super_type::vertex_descriptor misc::undirected_graph< VertexLabel, EdgeLabel >::vertex_descriptor
typedef boost::graph_traits<self_type>::vertex_iterator misc::graph< boost::undirectedS , VertexLabel, EdgeLabel >::vertex_iter_type
inherited

Iterators.

Iterator on the vertices of a graph.

Constructor & Destructor Documentation

template<typename VertexLabel , typename EdgeLabel >
misc::undirected_graph< VertexLabel, EdgeLabel >::~undirected_graph ( )
virtual

Member Function Documentation

template<typename VertexLabel , typename EdgeLabel >
void misc::undirected_graph< VertexLabel, EdgeLabel >::edge_add ( const vertex_descriptor v1,
const vertex_descriptor v2 
)
overridevirtual

Add an edge between two vertices.

Use this method instead of boost::add_edge directly to keep the order between the ends of an edge.

Implements misc::graph< boost::undirectedS, VertexLabel, EdgeLabel >.

virtual std::ostream& misc::graph< boost::undirectedS , VertexLabel, EdgeLabel >::epilogue_print ( std::ostream &  ostr) const
virtualinherited
const std::string& misc::graph< boost::undirectedS , VertexLabel, EdgeLabel >::name_get ( ) const
inherited

Graph name.

void misc::graph< boost::undirectedS , VertexLabel, EdgeLabel >::name_set ( const std::string &  name)
inherited
virtual std::ostream& misc::graph< boost::undirectedS , VertexLabel, EdgeLabel >::print ( std::ostream &  ostr) const
virtualinherited

Graph pretty printing.

virtual void misc::graph< boost::undirectedS , VertexLabel, EdgeLabel >::print ( std::string  file) const
virtualinherited
vertex_descriptor misc::graph< boost::undirectedS , VertexLabel, EdgeLabel >::vertex_add ( const VertexLabel &  l)
inherited

Add a vertex to the graph.

Graph manipulation.Just a wrapper around boost::add_vertex.


The documentation for this class was generated from the following files: