iterator.hh

Go to the documentation of this file.

#ifndef UTOPIA_CORE_GRAPH_ITERATORS_HH
#define UTOPIA_CORE_GRAPH_ITERATORS_HH
 
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/adjacency_matrix.hpp>
#include <boost/graph/subgraph.hpp>
#include <boost/graph/filtered_graph.hpp>
 
 
namespace Utopia {
enum class IterateOver {
    vertices,
 
    edges,
 
 
    neighbors,
 
 
    inv_neighbors,
 
 
    in_edges,
 
 
    out_edges
};
 
 
namespace GraphUtils
{
 
 
template<IterateOver iterate_over, typename Graph>
decltype(auto) iterator_pair(const Graph& g){
    using namespace boost;
 
    if constexpr (iterate_over == IterateOver::vertices){
        return vertices(g);
    }
    else if constexpr (iterate_over == IterateOver::edges){
        return edges(g);
    }
    else {
        static_assert((iterate_over == IterateOver::vertices)
                      or (iterate_over == IterateOver::edges),
                      "Only the iterator pairs of vertices and edges can be"
                      "returned: iterate_over is set wrong!");
    }
}
 
 
 
template<IterateOver iterate_over, typename Graph, typename EntityDesc>
decltype(auto) iterator_pair(EntityDesc e, const Graph& g){
    using namespace boost;
 
    if constexpr (iterate_over == IterateOver::neighbors){
        return adjacent_vertices(e, g);
    }
    else if constexpr (iterate_over == IterateOver::inv_neighbors){
        return inv_adjacent_vertices(e, g);
    }
    else if constexpr (iterate_over == IterateOver::in_edges){
        return in_edges(e, g);
    }
    else if constexpr (iterate_over == IterateOver::out_edges){
        return out_edges(e, g);
    }
    else {
        static_assert((iterate_over == IterateOver::neighbors)
                      or (iterate_over == IterateOver::inv_neighbors)
                      or (iterate_over == IterateOver::in_edges)
                      or (iterate_over == IterateOver::out_edges),
                      "Only the iterator pairs of neighbors, inv_neighbors, "
                      "in_edge, and out_edge can be returned: "
                      "iterate_over is set wrong!");
    }
}
 
} // namespace --- Graph
 
 
 
template<IterateOver iterate_over, typename Graph>
decltype(auto) range(const Graph& g){
    return boost::make_iterator_range(
                GraphUtils::iterator_pair<iterate_over>(g));
}
 
 
 
template<IterateOver iterate_over, typename Graph, typename EntityDesc>
decltype(auto) range(EntityDesc e, const Graph& g){
    return boost::make_iterator_range(
                GraphUtils::iterator_pair<iterate_over>(e, g));
}
 
// end group GraphIterators
} // namespace Utopia
 
#endif // UTOPIA_CORE_GRAPH_ITERATORS_HH