PGROUTING  3.2
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Path Member List

This is the complete list of members for Path, including all inherited members.

append(const Path &other)Path
appendPath(const Path &o_path)Path
back() constPathinline
back()Pathinline
begin()Pathinline
begin() constPathinline
clear()Path
collapse_paths(General_path_element_t **ret_path, const std::deque< Path > &paths)Pathfriend
complete_path(const G &graph, const V v_source, const V v_target, const std::vector< V > &predecessors, const std::vector< double > &distances, bool normal)Pathinline
ConstpthIt typedefPathprivate
count_tuples(const std::deque< Path > &paths)Pathfriend
countInfinityCost() constPath
empty() constPathinline
empty_path(unsigned int d_vertex)Path
end()Pathinline
end() constPathinline
end_id() constPathinline
end_id(int64_t value)Pathinline
equi_cost(std::deque< Path > &paths)Pathfriend
erase(pthIt pos)Pathinline
find_restriction(const pgrouting::trsp::Rule &rule) constPath
front() constPathinline
front()Pathinline
generate_postgres_data(General_path_element_t **postgres_data, size_t &sequence) constPath
get_pg_dd_path(General_path_element_t **ret_path, size_t &sequence) constPath
get_pg_ksp_path(General_path_element_t **ret_path, size_t &sequence, int routeId) constPath
get_pg_turn_restricted_path(General_path_element_t **ret_path, size_t &sequence, int routeId) constPath
getSubpath(unsigned int j) constPath
has_restriction(const pgrouting::trsp::Rule &rule) constPath
inf_cost_on_restriction(const pgrouting::trsp::Rule &rule)Path
isEqual(const Path &subpath) constPath
m_end_idPathprivate
m_start_idPathprivate
m_tot_costPathprivate
operator<<(std::ostream &log, const Path &p)Pathfriend
operator[](size_t i) constPathinline
operator[](size_t i)Pathinline
pathPathprivate
Path()Pathinline
Path(int64_t s_id, int64_t e_id)Pathinline
Path(const Path &)=defaultPath
Path(G &graph, int64_t source, double distance, const std::vector< V > &predecessors, const std::vector< double > &distances)Pathinline
Path(const G &graph, const Path &original, bool only_cost)Pathinline
Path(G &graph, V v_source, double distance, const std::vector< V > &predecessors, const std::vector< double > &distances)Pathinline
Path(const G &graph, const V v_source, const V v_target, const std::vector< V > &predecessors, const std::vector< double > &distances, bool only_cost, bool normal=true)Pathinline
pthIt typedefPathprivate
push_back(Path_t data)Path
push_front(Path_t data)Path
push_front(int64_t d_vertex, int64_t d_edge, double d_cost, double d_tot_cost)Path
recalculate_agg_cost()Path
renumber_vertices(int64_t value)Path
reverse()Path
set_data(int64_t d_from, int64_t d_to, int64_t d_vertex, int64_t d_edge, double d_cost, double d_tot_cost)Path
size() constPathinline
sort_by_node_agg_cost()Path
start_id() constPathinline
start_id(int64_t value)Pathinline
tot_cost() constPathinline