1 | // (C) Copyright 2013 Louis Dionne |
2 | // |
3 | // Use, modification and distribution are subject to the |
4 | // Boost Software License, Version 1.0 (See accompanying file |
5 | // LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) |
6 | |
7 | #include "cycle_test.hpp" |
8 | #include <boost/graph/hawick_circuits.hpp> |
9 | #include <iostream> |
10 | |
11 | struct call_hawick_circuits |
12 | { |
13 | template < typename Graph, typename Visitor > |
14 | void operator()(Graph const& g, Visitor const& v) const |
15 | { |
16 | boost::hawick_circuits(g, v); |
17 | } |
18 | }; |
19 | |
20 | struct call_hawick_unique_circuits |
21 | { |
22 | template < typename Graph, typename Visitor > |
23 | void operator()(Graph const& g, Visitor const& v) const |
24 | { |
25 | boost::hawick_unique_circuits(g, v); |
26 | } |
27 | }; |
28 | |
29 | int main() |
30 | { |
31 | std::cout << "---------hawick_circuits---------\n" ; |
32 | cycle_test(algorithm: call_hawick_circuits()); |
33 | |
34 | std::cout << "\n\n---------hawick_unique_circuits---------\n" ; |
35 | cycle_test(algorithm: call_hawick_unique_circuits()); |
36 | } |
37 | |