【C++】在boost中查找有向图的所有循环

在boost中查找有向图的所有循环

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/tiernan_all_cycles.hpp>
#include <iostream>

using Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::/*un*/directedS>;

// see https://github.com/boostorg/graph/issues/182
namespace boost { void renumber_vertex_indices(Graph const&) {} }

struct Vis {
    void cycle(auto const& path, Graph const& g) const {
        auto indices = get(boost::vertex_index, g);
        for (auto v : path)
            std::cout << "ABCDEFGHIJKL"[get(indices, v)] << " ";
        std::cout << "\n";
    };
};

int main()
{
    enum { A, B, C, D, E, F, G, H, I, J, K, L, NUM };
    Graph g(NUM);

    std::vector<std::pair<int, int>> pairs = {
        std::pair //
        { A, B }, { B, C }, { C, D }, { D, E }, { E, F }, { F, A },
        { G, H }, { H, I }, { I, J }, { J, K }, { K, L }, { L, G },
        { C, L }, { D, K }, { B, G }, { C, G }, { I, K }
    };

    for (auto [s, t] : pairs) //
        add_edge(s, t, g);

    tiernan_all_cycles(g, Vis{});
}