#include <boyer_myrvold_impl.hpp>
|
| boyer_myrvold_impl (const Graph &arg_g, VertexIndexMap arg_vm) |
|
bool | is_planar () |
|
template<typename EdgeToBoolPropertyMap , typename EdgeContainer > |
vertex_t | kuratowski_walkup (vertex_t v, EdgeToBoolPropertyMap forbidden_edge, EdgeToBoolPropertyMap goal_edge, EdgeToBoolPropertyMap is_embedded, EdgeContainer &path_edges) |
|
template<typename OutputIterator , typename EdgeIndexMap > |
void | extract_kuratowski_subgraph (OutputIterator o_itr, EdgeIndexMap em) |
|
template<typename EdgePermutation > |
void | make_edge_permutation (EdgePermutation perm) |
|
template<typename Graph , typename VertexIndexMap , typename StoreOldHandlesPolicy = graph::detail::store_old_handles, typename StoreEmbeddingPolicy = graph::detail::recursive_lazy_list>
template<typename Graph , typename VertexIndexMap , typename StoreOldHandlesPolicy = graph::detail::store_old_handles, typename StoreEmbeddingPolicy = graph::detail::recursive_lazy_list>
template<typename OutputIterator , typename EdgeIndexMap >
void boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::extract_kuratowski_subgraph |
( |
OutputIterator |
o_itr, |
|
|
EdgeIndexMap |
em |
|
) |
| |
|
inline |
References boost::asio::begin, boost::detail::BM_CASE_A, boost::detail::BM_CASE_B, boost::detail::BM_CASE_C, boost::detail::BM_CASE_D, boost::detail::BM_CASE_E, boost::detail::BM_NO_CASE_CHOSEN, boost::proto::child(), boost::edges(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::first_edge(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::first_vertex(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::get_anchor(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::kuratowski_walkup(), boost::xpressive::make_pair, boost::next(), boost::num_edges(), boost::num_vertices(), boost::out_edges(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::second_edge(), boost::source(), boost::swap, boost::target(), boost::detail::type, boost::vertices(), boost::flyweights::x, and boost::polygon::y().
template<typename Graph , typename VertexIndexMap , typename StoreOldHandlesPolicy = graph::detail::store_old_handles, typename StoreEmbeddingPolicy = graph::detail::recursive_lazy_list>
template<typename Graph , typename VertexIndexMap , typename StoreOldHandlesPolicy = graph::detail::store_old_handles, typename StoreEmbeddingPolicy = graph::detail::recursive_lazy_list>
template<typename EdgeToBoolPropertyMap , typename EdgeContainer >
vertex_t boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::kuratowski_walkup |
( |
vertex_t |
v, |
|
|
EdgeToBoolPropertyMap |
forbidden_edge, |
|
|
EdgeToBoolPropertyMap |
goal_edge, |
|
|
EdgeToBoolPropertyMap |
is_embedded, |
|
|
EdgeContainer & |
path_edges |
|
) |
| |
|
inline |
template<typename Graph , typename VertexIndexMap , typename StoreOldHandlesPolicy = graph::detail::store_old_handles, typename StoreEmbeddingPolicy = graph::detail::recursive_lazy_list>
template<typename EdgePermutation >
void boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::make_edge_permutation |
( |
EdgePermutation |
perm | ) |
|
|
inline |
The documentation for this class was generated from the following file: