edges_order_dfs_visitor.hpp

Go to the documentation of this file.

/*PGR-GNU*****************************************************************
File: edges_order_dfs_visitor.hpp
 
Copyright (c) 2015 pgRouting developers
Mail: [email protected]
 
Copyright (c) 2018 Aditya Pratap Singh
[email protected]
 
------
 
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
 
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
 
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 ********************************************************************PGR-GNU*/
#ifndef INCLUDE_VISITORS_EDGES_ORDER_DFS_VISITOR_HPP_
#define INCLUDE_VISITORS_EDGES_ORDER_DFS_VISITOR_HPP_
#pragma once
 
#include <boost/graph/depth_first_search.hpp>
#include <vector>
#include "visitors/found_goals.hpp"
 
namespace pgrouting {
namespace  visitors {
 
/* DFS */
template <class E>
class Edges_order_dfs_visitor : public boost::default_dfs_visitor {
 public:
     explicit Edges_order_dfs_visitor(
             std::vector<E> &data) :
         m_data(data)  {}
     template <typename B_G>
         void tree_edge(E e, const B_G&) {
             m_data.push_back(e);
         }
 private:
     std::vector<E> &m_data;
};
 
 
}  // namespace visitors
}  // namespace pgrouting
 
#endif  // INCLUDE_VISITORS_EDGES_ORDER_DFS_VISITOR_HPP_