tiernan_all_cycles.hpp File Reference

#include <vector>
#include <boost/config.hpp>
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include <boost/concept/assert.hpp>
#include <boost/concept/detail/concept_def.hpp>
#include <boost/concept/detail/concept_undef.hpp>

Include dependency graph for tiernan_all_cycles.hpp:

Classes
struct	boost::cycle_visitor
	The default cycle visitor provides an empty visit function for cycle visitors. More...
struct	boost::min_max_cycle_visitor
	The min_max_cycle_visitor simultaneously records the minimum and maximum cycles in a graph. More...
struct	boost::detail::min_cycles< D >
struct	boost::detail::min_cycles< undirected_tag >

Namespaces
	boost
	Duration formatting facet for input.
	boost::concepts
	boost::detail

Functions
	boost::concepts::BOOST_concept (CycleVisitor,(Visitor)(Path)(Graph))
min_max_cycle_visitor	boost::find_min_max_cycle (std::size_t &min_, std::size_t &max_)
template<typename Graph , typename Path >
bool	boost::detail::is_vertex_in_path (const Graph &, typename graph_traits< Graph >::vertex_descriptor v, const Path &p)
template<typename Graph , typename ClosedMatrix >
bool	boost::detail::is_path_closed (const Graph &g, typename graph_traits< Graph >::vertex_descriptor u, typename graph_traits< Graph >::vertex_descriptor v, const ClosedMatrix &closed)
template<typename Graph , typename Path , typename ClosedMatrix >
bool	boost::detail::can_extend_path (const Graph &g, typename graph_traits< Graph >::edge_descriptor e, const Path &p, const ClosedMatrix &m)
template<typename Graph , typename Path >
bool	boost::detail::can_wrap_path (const Graph &g, const Path &p)
template<typename Graph , typename Path , typename ClosedMatrix >
graph_traits< Graph > ::vertex_descriptor	boost::detail::extend_path (const Graph &g, Path &p, ClosedMatrix &closed)
template<typename Graph , typename Path , typename ClosedMatrix >
bool	boost::detail::exhaust_paths (const Graph &g, Path &p, ClosedMatrix &closed)
template<typename Graph , typename Visitor >
void	boost::detail::all_cycles_from_vertex (const Graph &g, typename graph_traits< Graph >::vertex_descriptor v, Visitor vis, std::size_t minlen, std::size_t maxlen)
template<typename Graph , typename Visitor >
void	boost::tiernan_all_cycles (const Graph &g, Visitor vis, std::size_t minlen, std::size_t maxlen)
template<typename Graph , typename Visitor >
void	boost::tiernan_all_cycles (const Graph &g, Visitor vis, std::size_t maxlen)
template<typename Graph , typename Visitor >
void	boost::tiernan_all_cycles (const Graph &g, Visitor vis)
template<typename Graph >
std::pair< std::size_t, std::size_t >	boost::tiernan_girth_and_circumference (const Graph &g)
template<typename Graph >
std::size_t	boost::tiernan_girth (const Graph &g)
template<typename Graph >
std::size_t	boost::tiernan_circumference (const Graph &g)