Boost  v1.57.0
doxygen for www.boost.org
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
hawick_circuits.hpp File Reference
#include <algorithm>
#include <boost/assert.hpp>
#include <boost/foreach.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/one_bit_color_map.hpp>
#include <boost/graph/properties.hpp>
#include <boost/move/utility.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/range/iterator.hpp>
#include <boost/tuple/tuple.hpp>
#include <boost/type_traits/remove_reference.hpp>
#include <boost/utility/result_of.hpp>
#include <set>
#include <utility>
#include <vector>
Include dependency graph for hawick_circuits.hpp:

Classes

struct  boost::hawick_circuits_detail::get_all_adjacent_vertices
 
struct  boost::hawick_circuits_detail::get_all_adjacent_vertices::result< Sig >
 
struct  boost::hawick_circuits_detail::get_all_adjacent_vertices::result< This(Vertex, Graph)>
 
struct  boost::hawick_circuits_detail::get_unique_adjacent_vertices
 
struct  boost::hawick_circuits_detail::get_unique_adjacent_vertices::result< Sig >
 
struct  boost::hawick_circuits_detail::get_unique_adjacent_vertices::result< This(Vertex, Graph)>
 
struct  boost::hawick_circuits_detail::hawick_circuits_from< Graph, Visitor, VertexIndexMap, Stack, ClosedMatrix, GetAdjacentVertices >
 

Namespaces

 boost
 Duration formatting facet for input.
 
 boost::hawick_circuits_detail
 

Functions

template<typename Container , typename Value >
bool boost::hawick_circuits_detail::contains (Container const &c, Value const &v)
 
template<typename GetAdjacentVertices , typename Graph , typename Visitor , typename VertexIndexMap >
void boost::hawick_circuits_detail::call_hawick_circuits (Graph const &graph, Visitorvisitor, VertexIndexMap const &vertex_index_map)
 
template<typename GetAdjacentVertices , typename Graph , typename Visitor >
void boost::hawick_circuits_detail::call_hawick_circuits (Graph const &graph, BOOST_FWD_REF(Visitor) visitor)
 
template<typename Graph , typename Visitor , typename VertexIndexMap >
void boost::hawick_circuits (BOOST_FWD_REF(Graph) graph, BOOST_FWD_REF(Visitor) visitor, BOOST_FWD_REF(VertexIndexMap) vertex_index_map)
 Enumerate all the elementary circuits in a directed multigraph. More...
 
template<typename Graph , typename Visitor >
void boost::hawick_circuits (BOOST_FWD_REF(Graph) graph, BOOST_FWD_REF(Visitor) visitor)
 
template<typename Graph , typename Visitor , typename VertexIndexMap >
void boost::hawick_unique_circuits (BOOST_FWD_REF(Graph) graph, BOOST_FWD_REF(Visitor) visitor, BOOST_FWD_REF(VertexIndexMap) vertex_index_map)
 Same as boost::hawick_circuits, but duplicate circuits caused by parallel edges will not be considered. More...
 
template<typename Graph , typename Visitor >
void boost::hawick_unique_circuits (BOOST_FWD_REF(Graph) graph, BOOST_FWD_REF(Visitor) visitor)