undirected_graph.hh File Reference

#include <boost/graph/adjacency_iterator.hpp>
#include <boost/graph/properties.hpp>
#include <boost/static_assert.hpp>
#include <utilmm/iterator_sequence.hh>
#include <boost/iterator/transform_iterator.hpp>
#include <boost/type_traits.hpp>

Go to the source code of this file.

Namespaces
namespace	utilmm
namespace	utilmm::detail
namespace	boost
namespace	boost::detail
Classes
struct	utilmm::undirected_graph_tag
class	utilmm::undirected_graph< BidirectionalGraph, GraphRef >
class	utilmm::undirected_graph< BidirectionalGraph, GraphRef >::base_out_edge_iterator
class	utilmm::undirected_graph< BidirectionalGraph, GraphRef >::base_in_edge_iterator
class	utilmm::undirected_graph< BidirectionalGraph, GraphRef >::edge_iterator
struct	utilmm::detail::undirected_graph_vertex_property_selector
struct	utilmm::detail::undirected_graph_vertex_property_selector::bind_< UndirectedGraph, Property, Tag >
struct	utilmm::detail::undirected_graph_edge_property_selector
struct	utilmm::detail::undirected_graph_edge_property_selector::bind_< UndirectedGraph, Property, Tag >
class	utilmm::undirected_property_map< PropertyMap >
struct	boost::property_traits< utilmm::undirected_property_map< PropertyMap > >
struct	boost::vertex_property_selector< utilmm::undirected_graph_tag >
struct	boost::edge_property_selector< utilmm::undirected_graph_tag >
struct	boost::detail::get_property_map_type< BidirGraph, GRef, Property >
struct	boost::detail::get_property_map_type< BidirGraph, const BidirGraph &, Property >
struct	boost::detail::get_property_map_type< BidirGraph, BidirGraph &, Property >
Functions
template<class BidirectionalGraph>
undirected_graph < BidirectionalGraph >	utilmm::make_undirected_graph (const BidirectionalGraph &g)
template<class BidirectionalGraph>
undirected_graph < BidirectionalGraph, BidirectionalGraph & >	utilmm::make_undirected_graph (BidirectionalGraph &g)
template<class BidirectionalGraph, class GRef>
std::pair< typename undirected_graph < BidirectionalGraph > ::vertex_iterator, typename undirected_graph < BidirectionalGraph > ::vertex_iterator >	utilmm::vertices (const undirected_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph, class GRef>
std::pair< typename undirected_graph < BidirectionalGraph > ::edge_iterator, typename undirected_graph < BidirectionalGraph > ::edge_iterator >	utilmm::edges (const undirected_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph, class GRef>
std::pair< typename undirected_graph < BidirectionalGraph, GRef > ::out_edge_iterator, typename undirected_graph < BidirectionalGraph, GRef > ::out_edge_iterator >	utilmm::out_edges (const typename BidirectionalGraph::vertex_descriptor u, const undirected_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph, class GRef>
BidirectionalGraph::vertices_size_type	utilmm::num_vertices (const undirected_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph, class GRef>
undirected_graph < BidirectionalGraph > ::edges_size_type	utilmm::num_edges (const undirected_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph, class GRef>
BidirectionalGraph::degree_size_type	utilmm::out_degree (const typename BidirectionalGraph::vertex_descriptor u, const undirected_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph, class GRef>
std::pair< typename BidirectionalGraph::edge_descriptor, bool >	utilmm::edge (const typename BidirectionalGraph::vertex_descriptor u, const typename BidirectionalGraph::vertex_descriptor v, const undirected_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph, class GRef>
std::pair< typename BidirectionalGraph::out_edge_iterator, typename BidirectionalGraph::out_edge_iterator >	utilmm::in_edges (const typename BidirectionalGraph::vertex_descriptor u, const undirected_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph, class GRef>
std::pair< typename undirected_graph < BidirectionalGraph, GRef > ::adjacency_iterator, typename undirected_graph < BidirectionalGraph, GRef > ::adjacency_iterator >	utilmm::adjacent_vertices (const typename BidirectionalGraph::vertex_descriptor u, const undirected_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph, class GRef>
BidirectionalGraph::degree_size_type	utilmm::in_degree (const typename BidirectionalGraph::vertex_descriptor u, const undirected_graph< BidirectionalGraph, GRef > &g)
template<class Edge, class BidirectionalGraph, class GRef>
boost::graph_traits < BidirectionalGraph > ::vertex_descriptor	utilmm::source (const Edge &e, const undirected_graph< BidirectionalGraph, GRef > &g)
template<class Edge, class BidirectionalGraph, class GRef>
boost::graph_traits < BidirectionalGraph > ::vertex_descriptor	utilmm::target (const Edge &e, const undirected_graph< BidirectionalGraph, GRef > &g)
template<typename PropertyMap, typename EdgeDescriptor, typename ValueType>
void	utilmm::put (undirected_property_map< PropertyMap > &map, EdgeDescriptor e, ValueType value)
template<typename PropertyMap, typename EdgeDescriptor>
boost::property_traits < PropertyMap > ::value_type	utilmm::get (undirected_property_map< PropertyMap > const &map, EdgeDescriptor e)
template<typename PropertyMap>
undirected_property_map < PropertyMap >	utilmm::make_undirected_edge_map (PropertyMap pmap)
template<class BidirGraph, class GRef, class Property>
detail::get_property_map_type < BidirGraph, GRef, Property >::type	boost::get (Property p, utilmm::undirected_graph< BidirGraph, GRef > &g)
template<class BidirGraph, class GRef, class Property>
detail::get_property_map_type < BidirGraph, GRef, Property >::type	boost::get (Property p, const utilmm::undirected_graph< BidirGraph, GRef > &g)
template<class BidirectionalGraph, class GRef, class Property, class Key>
property_traits < typename property_map < BidirectionalGraph, Property > ::const_type > ::value_type	boost::get (Property p, const utilmm::undirected_graph< BidirectionalGraph, GRef > &g, const Key &k)
template<class BidirectionalGraph, class GRef, class Property, class Key, class Value>
void	boost::put (Property p, const utilmm::undirected_graph< BidirectionalGraph, GRef > &g, const Key &k, const Value &val)
template<typename BidirectionalGraph, typename GRef, typename Tag, typename Value>
void	boost::set_property (const utilmm::undirected_graph< BidirectionalGraph, GRef > &g, Tag tag, const Value &value)
template<typename BidirectionalGraph, typename GRef, typename Tag>
graph_property < BidirectionalGraph, Tag >::type	boost::get_property (const utilmm::undirected_graph< BidirectionalGraph, GRef > &g, Tag tag)

---