cout_utility.hpp

Go to the documentation of this file.

#ifndef MSMAZES_CORE_DEBUG_COUT_UTILITY_HPP
#define MSMAZES_CORE_DEBUG_COUT_UTILITY_HPP

#include <iostream>  // std::ostream and std::cout
#include <boost/utility.hpp>  // boost::tie
#include <boost/property_map.hpp>  // boost::property_map and boost::get
#include <boost/graph/graph_traits.hpp>  // boost::graph_traits
//#include <boost/graph/adjacency_list.hpp> must be included before this file.

namespace msmazes {


template <typename EventFilter>
struct COutVertexVisitor
{
    typedef EventFilter
            event_filter;

    template <typename Vertex, typename Graph>
    void operator()(Vertex v, Graph& g)
    {
        typename boost::property_map<Graph,boost::vertex_index_t>::type
          index_map = boost::get(boost::vertex_index_t(), g);

        std::cout << "  Vertex <" << boost::get(index_map, v) << std::endl;
    }
};


template <typename EventFilter>
struct COutEdgeVisitor
{
    typedef EventFilter
            event_filter;

    template <typename Edge, typename Graph>
    void operator()(Edge e, Graph& g)
    {
        typename boost::property_map<Graph,boost::vertex_index_t>::type
          index_map = boost::get(boost::vertex_index_t(), g);

        std::cout << "  Edge <" << boost::get(index_map, boost::source(e, g));
        std::cout << "," << boost::get(index_map, boost::target(e, g));
        std::cout << ">" << std::endl;
    }
};


template <
    typename PathIterator
  , typename VertexIDMap
>
void
    coutPath(
        PathIterator begin
      , PathIterator end
      , const VertexIDMap id_map
    )
{
    std::cout << boost::get(id_map, *begin);

    while (++begin != end)
    {
        std::cout << " -> " << boost::get(id_map, *begin);
    }

    std::cout << std::endl;
}


template <
    typename VertexListGraph
  , typename VertexIDMap
  , typename PredecessorMap
>
void
    coutPredecessorMap(
        const VertexListGraph& g
      , const VertexIDMap id_map
      , const PredecessorMap p_map
    )
{
    typename boost::graph_traits<VertexListGraph>::vertex_iterator vi, vend;

    for (boost::tie(vi, vend) = boost::vertices(g); vi != vend; ++vi)
    {
        std::cout << "Vertex " << boost::get(id_map, *vi);
        std::cout << ", predecessor ";
        std::cout << boost::get(id_map, boost::get(p_map, *vi));
        std::cout << std::endl;
    }

    std::cout << std::endl;
}


template <
    typename VertexListGraph
  , typename VertexIDMap
  , typename PropertyMap
>
void
    coutVertexPmap(
        const VertexListGraph& g
      , const VertexIDMap id_map
      , const PropertyMap p_map
    )
{
    typename boost::graph_traits<VertexListGraph>::vertex_iterator vi, vend;

    for (boost::tie(vi, vend) = boost::vertices(g); vi != vend; ++vi)
    {
        std::cout << "Vertex "  << boost::get(id_map, *vi);
        std::cout << ", value " << boost::get(p_map, *vi);
        std::cout << std::endl;
    }

    std::cout << std::endl;
}


template <
    typename EdgeListGraph
  , typename VertexIDMap
  , typename PropertyMap
>
void
    coutEdgePmap(
        const EdgeListGraph& g
      , const VertexIDMap id_map
      , const PropertyMap p_map
    )
{
    typename boost::graph_traits<EdgeListGraph>::edge_iterator ei, eend;

    for (boost::tie(ei, eend) = boost::edges(g); ei != eend; ++ei)
    {
        std::cout << "Edge " << boost::get(id_map, boost::source(*ei, g));
        std::cout << "-"     << boost::get(id_map, boost::target(*ei, g));
        std::cout << ", value " << boost::get(p_map, *ei);
        std::cout << std::endl;
    }

    std::cout << std::endl;
}
}  // namespace msmazes

#endif  /* MSMAZES_CORE_DEBUG_COUT_UTILITY_HPP */

---

Multi-State Mazes in C++ is hosted by . Use the Table of Contents for navigation.