The min_max_cycle_visitor simultaneously records the minimum and maximum cycles in a graph.
More...
#include <tiernan_all_cycles.hpp>
|
| min_max_cycle_visitor (std::size_t &min_, std::size_t &max_) |
|
template<typename Path , typename Graph > |
void | cycle (const Path &p, const Graph &g) |
|
The min_max_cycle_visitor simultaneously records the minimum and maximum cycles in a graph.
boost::min_max_cycle_visitor::min_max_cycle_visitor |
( |
std::size_t & |
min_, |
|
|
std::size_t & |
max_ |
|
) |
| |
|
inline |
template<typename Path , typename Graph >
void boost::min_max_cycle_visitor::cycle |
( |
const Path & |
p, |
|
|
const Graph & |
g |
|
) |
| |
|
inline |
std::size_t& boost::min_max_cycle_visitor::maximum |
std::size_t& boost::min_max_cycle_visitor::minimum |
The documentation for this struct was generated from the following file: