pgrouting::visitors::Dfs_visitor< V, E, G > Class Template Reference

#include "dfs_visitor.hpp"

Inheritance diagram for pgrouting::visitors::Dfs_visitor< V, E, G >:

Collaboration diagram for pgrouting::visitors::Dfs_visitor< V, E, G >:

Public Member Functions
	Dfs_visitor (V root, std::vector< E > &data, int64_t max_depth, std::vector< boost::default_color_type > &colors, G &graph)
template<typename B_G >
void	examine_edge (E e, const B_G &)
template<typename B_G >
void	start_vertex (V v, const B_G &)
template<typename B_G >
void	tree_edge (E e, const B_G &)

Private Attributes
std::vector< boost::default_color_type > &	m_colors
std::vector< E > &	m_data
std::vector< int64_t >	m_depth
G &	m_graph
int64_t	m_max_depth
V	m_roots

Detailed Description

template<typename V, typename E, typename G>
class pgrouting::visitors::Dfs_visitor< V, E, G >

Definition at line 45 of file dfs_visitor.hpp.

Constructor & Destructor Documentation

Dfs_visitor()

template<typename V , typename E , typename G >

pgrouting::visitors::Dfs_visitor< V, E, G >::Dfs_visitor ( V  root, std::vector< E > &  data, int64_t  max_depth, std::vector< boost::default_color_type > &  colors, G &  graph  )

inline

Definition at line 47 of file dfs_visitor.hpp.

                       :
         m_roots(root),
         m_data(data),
         m_max_depth(max_depth),
         m_colors(colors),
         m_graph(graph) {
             m_depth.resize(m_graph.num_vertices(), 0);
         }

References pgrouting::visitors::Dfs_visitor< V, E, G >::m_depth, and pgrouting::visitors::Dfs_visitor< V, E, G >::m_graph.

Member Function Documentation

examine_edge()

template<typename V , typename E , typename G >

template<typename B_G >

void pgrouting::visitors::Dfs_visitor< V, E, G >::examine_edge ( E  e, const B_G &    )

inline

Definition at line 67 of file dfs_visitor.hpp.

                                            {
             auto source = m_graph.source(e), target = m_graph.target(e);
             // If the target has not been visited before
             if (m_depth[target] == 0 && target != m_roots)
                 m_depth[target] = m_depth[source] + 1;
 
             // If the max_depth is reached, mark the target as visited, and push the corresponding edge
             if (m_depth[target] == m_max_depth && m_colors[target] != 4) {
                 m_colors[target] = boost::black_color;
                 m_data.push_back(e);
             }
         }

References pgrouting::visitors::Dfs_visitor< V, E, G >::m_colors, pgrouting::visitors::Dfs_visitor< V, E, G >::m_data, pgrouting::visitors::Dfs_visitor< V, E, G >::m_depth, pgrouting::visitors::Dfs_visitor< V, E, G >::m_graph, pgrouting::visitors::Dfs_visitor< V, E, G >::m_max_depth, and pgrouting::visitors::Dfs_visitor< V, E, G >::m_roots.

start_vertex()

template<typename V , typename E , typename G >

template<typename B_G >

void pgrouting::visitors::Dfs_visitor< V, E, G >::start_vertex ( V  v, const B_G &    )

inline

Definition at line 61 of file dfs_visitor.hpp.

                                            {
             // exception for visitor termination
             if (v != m_roots) throw found_goals();
             m_depth[v] = 0;
         }

References pgrouting::visitors::Dfs_visitor< V, E, G >::m_depth, and pgrouting::visitors::Dfs_visitor< V, E, G >::m_roots.

tree_edge()

template<typename V , typename E , typename G >

template<typename B_G >

void pgrouting::visitors::Dfs_visitor< V, E, G >::tree_edge ( E  e, const B_G &    )

inline

Definition at line 80 of file dfs_visitor.hpp.

                                         {
             m_data.push_back(e);
         }

References pgrouting::visitors::Dfs_visitor< V, E, G >::m_data.

Member Data Documentation

m_colors

template<typename V , typename E , typename G >

std::vector<boost::default_color_type>& pgrouting::visitors::Dfs_visitor< V, E, G >::m_colors

private

Definition at line 88 of file dfs_visitor.hpp.

Referenced by pgrouting::visitors::Dfs_visitor< V, E, G >::examine_edge().

m_data

template<typename V , typename E , typename G >

std::vector<E>& pgrouting::visitors::Dfs_visitor< V, E, G >::m_data

private

Definition at line 86 of file dfs_visitor.hpp.

Referenced by pgrouting::visitors::Dfs_visitor< V, E, G >::examine_edge(), and pgrouting::visitors::Dfs_visitor< V, E, G >::tree_edge().

m_depth

template<typename V , typename E , typename G >

std::vector<int64_t> pgrouting::visitors::Dfs_visitor< V, E, G >::m_depth

private

Definition at line 90 of file dfs_visitor.hpp.

Referenced by pgrouting::visitors::Dfs_visitor< V, E, G >::Dfs_visitor(), pgrouting::visitors::Dfs_visitor< V, E, G >::examine_edge(), and pgrouting::visitors::Dfs_visitor< V, E, G >::start_vertex().

m_graph

template<typename V , typename E , typename G >

G& pgrouting::visitors::Dfs_visitor< V, E, G >::m_graph

private

Definition at line 89 of file dfs_visitor.hpp.

Referenced by pgrouting::visitors::Dfs_visitor< V, E, G >::Dfs_visitor(), and pgrouting::visitors::Dfs_visitor< V, E, G >::examine_edge().

m_max_depth

template<typename V , typename E , typename G >

int64_t pgrouting::visitors::Dfs_visitor< V, E, G >::m_max_depth

private

Definition at line 87 of file dfs_visitor.hpp.

Referenced by pgrouting::visitors::Dfs_visitor< V, E, G >::examine_edge().

m_roots

template<typename V , typename E , typename G >

V pgrouting::visitors::Dfs_visitor< V, E, G >::m_roots

private

Definition at line 85 of file dfs_visitor.hpp.

Referenced by pgrouting::visitors::Dfs_visitor< V, E, G >::examine_edge(), and pgrouting::visitors::Dfs_visitor< V, E, G >::start_vertex().

---

The documentation for this class was generated from the following file:

• dfs_visitor.hpp