#include <undirected_graph.hh>
Classes | |
| class | base_in_edge_iterator |
| class | base_out_edge_iterator |
| class | edge_iterator |
Public Types | |
| typedef iterator_sequence < typename Traits::adjacency_iterator, typename BidirectionalGraph::inv_adjacency_iterator > | adjacency_iterator |
| typedef BidirectionalGraph | base_type |
| typedef Traits::degree_size_type | degree_size_type |
| typedef boost::undirected_tag | directed_category |
| typedef std::pair< typename Traits::edge_descriptor, bool > | edge_descriptor |
| typedef Traits::edge_iterator | edge_iterator |
| typedef Traits::edge_parallel_category | edge_parallel_category |
| typedef BidirectionalGraph::edge_property_type | edge_property_type |
| typedef Traits::edges_size_type | edges_size_type |
| typedef undirected_graph_tag | graph_tag |
| typedef iterator_sequence < base_in_edge_iterator, base_out_edge_iterator > | in_edge_iterator |
| typedef adjacency_iterator | inv_adjacency_iterator |
| typedef edge_descriptor(* | make_undirected_edge_descriptor )(typename Traits::edge_descriptor) |
| typedef in_edge_iterator | out_edge_iterator |
| typedef Traits::traversal_category | traversal_category |
| typedef Traits::vertex_descriptor | vertex_descriptor |
| typedef Traits::vertex_iterator | vertex_iterator |
| typedef BidirectionalGraph::vertex_property_type | vertex_property_type |
| typedef Traits::vertices_size_type | vertices_size_type |
Public Member Functions | |
| boost::graph::detail::bundled_result < BidirectionalGraph, edge_descriptor >::type & | operator[] (edge_descriptor x) |
| boost::graph::detail::bundled_result < BidirectionalGraph, edge_descriptor >::type const & | operator[] (edge_descriptor x) const |
| boost::graph::detail::bundled_result < BidirectionalGraph, vertex_descriptor >::type & | operator[] (vertex_descriptor x) |
| boost::graph::detail::bundled_result < BidirectionalGraph, vertex_descriptor >::type const & | operator[] (vertex_descriptor x) const |
| undirected_graph (GraphRef g) | |
Static Public Member Functions | |
| static edge_descriptor | make_in_edge_descriptor (typename Traits::edge_descriptor e) |
| static edge_descriptor | make_out_edge_descriptor (typename Traits::edge_descriptor e) |
| static vertex_descriptor | null_vertex () |
Public Attributes | |
| GraphRef | m_g |
Private Types | |
| typedef undirected_graph < BidirectionalGraph, GraphRef > | Self |
| typedef boost::graph_traits < BidirectionalGraph > | Traits |
Private Member Functions | |
| BOOST_STATIC_ASSERT ((boost::is_same< boost::bidirectional_tag, typename BidirectionalGraph::directed_category >::value)) | |
undirected_graph creates an undirected graph from a bidirectional graph. This can allow to use some undirected-graph-only algorithms on bidirectional graphs
Definition at line 28 of file undirected_graph.hh.
| typedef iterator_sequence< typename Traits::adjacency_iterator , typename BidirectionalGraph::inv_adjacency_iterator > utilmm::undirected_graph< BidirectionalGraph, GraphRef >::adjacency_iterator |
Definition at line 104 of file undirected_graph.hh.
| typedef BidirectionalGraph utilmm::undirected_graph< BidirectionalGraph, GraphRef >::base_type |
Definition at line 35 of file undirected_graph.hh.
| typedef Traits::degree_size_type utilmm::undirected_graph< BidirectionalGraph, GraphRef >::degree_size_type |
Definition at line 93 of file undirected_graph.hh.
| typedef boost::undirected_tag utilmm::undirected_graph< BidirectionalGraph, GraphRef >::directed_category |
Definition at line 42 of file undirected_graph.hh.
| typedef std::pair<typename Traits::edge_descriptor, bool> utilmm::undirected_graph< BidirectionalGraph, GraphRef >::edge_descriptor |
Definition at line 48 of file undirected_graph.hh.
| typedef Traits::edge_iterator utilmm::undirected_graph< BidirectionalGraph, GraphRef >::edge_iterator |
Definition at line 111 of file undirected_graph.hh.
| typedef Traits::edge_parallel_category utilmm::undirected_graph< BidirectionalGraph, GraphRef >::edge_parallel_category |
Definition at line 43 of file undirected_graph.hh.
| typedef BidirectionalGraph::edge_property_type utilmm::undirected_graph< BidirectionalGraph, GraphRef >::edge_property_type |
Definition at line 117 of file undirected_graph.hh.
| typedef Traits::edges_size_type utilmm::undirected_graph< BidirectionalGraph, GraphRef >::edges_size_type |
Definition at line 113 of file undirected_graph.hh.
| typedef undirected_graph_tag utilmm::undirected_graph< BidirectionalGraph, GraphRef >::graph_tag |
Definition at line 120 of file undirected_graph.hh.
| typedef iterator_sequence< base_in_edge_iterator , base_out_edge_iterator > utilmm::undirected_graph< BidirectionalGraph, GraphRef >::in_edge_iterator |
Definition at line 97 of file undirected_graph.hh.
| typedef adjacency_iterator utilmm::undirected_graph< BidirectionalGraph, GraphRef >::inv_adjacency_iterator |
Definition at line 105 of file undirected_graph.hh.
| typedef edge_descriptor(* utilmm::undirected_graph< BidirectionalGraph, GraphRef >::make_undirected_edge_descriptor)(typename Traits::edge_descriptor) |
Definition at line 49 of file undirected_graph.hh.
| typedef in_edge_iterator utilmm::undirected_graph< BidirectionalGraph, GraphRef >::out_edge_iterator |
Definition at line 98 of file undirected_graph.hh.
typedef undirected_graph<BidirectionalGraph, GraphRef> utilmm::undirected_graph< BidirectionalGraph, GraphRef >::Self [private] |
Definition at line 29 of file undirected_graph.hh.
typedef boost::graph_traits<BidirectionalGraph> utilmm::undirected_graph< BidirectionalGraph, GraphRef >::Traits [private] |
Definition at line 30 of file undirected_graph.hh.
| typedef Traits::traversal_category utilmm::undirected_graph< BidirectionalGraph, GraphRef >::traversal_category |
Definition at line 44 of file undirected_graph.hh.
| typedef Traits::vertex_descriptor utilmm::undirected_graph< BidirectionalGraph, GraphRef >::vertex_descriptor |
Definition at line 41 of file undirected_graph.hh.
| typedef Traits::vertex_iterator utilmm::undirected_graph< BidirectionalGraph, GraphRef >::vertex_iterator |
Definition at line 108 of file undirected_graph.hh.
| typedef BidirectionalGraph::vertex_property_type utilmm::undirected_graph< BidirectionalGraph, GraphRef >::vertex_property_type |
Definition at line 119 of file undirected_graph.hh.
| typedef Traits::vertices_size_type utilmm::undirected_graph< BidirectionalGraph, GraphRef >::vertices_size_type |
Definition at line 112 of file undirected_graph.hh.
| utilmm::undirected_graph< BidirectionalGraph, GraphRef >::undirected_graph | ( | GraphRef | g | ) | [inline] |
Definition at line 38 of file undirected_graph.hh.
| utilmm::undirected_graph< BidirectionalGraph, GraphRef >::BOOST_STATIC_ASSERT | ( | (boost::is_same< boost::bidirectional_tag, typename BidirectionalGraph::directed_category >::value) | ) | [private] |
| static edge_descriptor utilmm::undirected_graph< BidirectionalGraph, GraphRef >::make_in_edge_descriptor | ( | typename Traits::edge_descriptor | e | ) | [inline, static] |
Definition at line 66 of file undirected_graph.hh.
| static edge_descriptor utilmm::undirected_graph< BidirectionalGraph, GraphRef >::make_out_edge_descriptor | ( | typename Traits::edge_descriptor | e | ) | [inline, static] |
Definition at line 52 of file undirected_graph.hh.
| static vertex_descriptor utilmm::undirected_graph< BidirectionalGraph, GraphRef >::null_vertex | ( | ) | [inline, static] |
Definition at line 122 of file undirected_graph.hh.
| boost::graph::detail::bundled_result<BidirectionalGraph, edge_descriptor>::type& utilmm::undirected_graph< BidirectionalGraph, GraphRef >::operator[] | ( | edge_descriptor | x | ) | [inline] |
Definition at line 128 of file undirected_graph.hh.
| boost::graph::detail::bundled_result<BidirectionalGraph, edge_descriptor>::type const& utilmm::undirected_graph< BidirectionalGraph, GraphRef >::operator[] | ( | edge_descriptor | x | ) | const [inline] |
Definition at line 133 of file undirected_graph.hh.
| boost::graph::detail::bundled_result<BidirectionalGraph, vertex_descriptor>::type& utilmm::undirected_graph< BidirectionalGraph, GraphRef >::operator[] | ( | vertex_descriptor | x | ) | [inline] |
Definition at line 140 of file undirected_graph.hh.
| boost::graph::detail::bundled_result<BidirectionalGraph, vertex_descriptor>::type const& utilmm::undirected_graph< BidirectionalGraph, GraphRef >::operator[] | ( | vertex_descriptor | x | ) | const [inline] |
Definition at line 145 of file undirected_graph.hh.
| GraphRef utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g |
Definition at line 151 of file undirected_graph.hh.