#include <boost/config.hpp>
#include <boost/tuple/tuple.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/isomorphism.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <algorithm>
#include <vector>
#include <set>
Namespaces | |
boost | |
Duration formatting facet for input. | |
boost::detail | |
Enumerations | |
enum | boost::detail::target_graph_t { boost::detail::tg_k_3_3, boost::detail::tg_k_5 } |
Functions | |
template<typename Graph > | |
Graph | boost::detail::make_K_5 () |
template<typename Graph > | |
Graph | boost::detail::make_K_3_3 () |
template<typename AdjacencyList , typename Vertex > | |
void | boost::detail::contract_edge (AdjacencyList &neighbors, Vertex u, Vertex v) |
template<typename Graph , typename ForwardIterator , typename VertexIndexMap > | |
bool | boost::is_kuratowski_subgraph (const Graph &g, ForwardIterator begin, ForwardIterator end, VertexIndexMap vm) |
template<typename Graph , typename ForwardIterator > | |
bool | boost::is_kuratowski_subgraph (const Graph &g, ForwardIterator begin, ForwardIterator end) |