mirror of
https://github.com/boostorg/graph.git
synced 2025-05-11 05:14:01 +00:00
37 lines
936 B
C++
37 lines
936 B
C++
// (C) Copyright 2013 Louis Dionne
|
|
//
|
|
// Use, modification and distribution are subject to the
|
|
// Boost Software License, Version 1.0 (See accompanying file
|
|
// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#include "cycle_test.hpp"
|
|
#include <boost/graph/hawick_circuits.hpp>
|
|
#include <iostream>
|
|
|
|
struct call_hawick_circuits
|
|
{
|
|
template < typename Graph, typename Visitor >
|
|
void operator()(Graph const& g, Visitor const& v) const
|
|
{
|
|
boost::hawick_circuits(g, v);
|
|
}
|
|
};
|
|
|
|
struct call_hawick_unique_circuits
|
|
{
|
|
template < typename Graph, typename Visitor >
|
|
void operator()(Graph const& g, Visitor const& v) const
|
|
{
|
|
boost::hawick_unique_circuits(g, v);
|
|
}
|
|
};
|
|
|
|
int main()
|
|
{
|
|
std::cout << "---------hawick_circuits---------\n";
|
|
cycle_test(call_hawick_circuits());
|
|
|
|
std::cout << "\n\n---------hawick_unique_circuits---------\n";
|
|
cycle_test(call_hawick_unique_circuits());
|
|
}
|