pgRouting
pgRouting extends the PostGIS / PostgreSQL geospatial database to provide geospatial routing functionality.
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
GraphDefinition Member List

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

add_virtual_vertices(int start_edge, double start_part, int end_edge, double end_part, int64_t &start_vertex, int64_t &end_vertex)GraphDefinition
addEdge(edge_t edgeIn)GraphDefinitionprivate
connectEdge(GraphEdgeInfo &firstEdge, GraphEdgeInfo &secondEdge, bool bIsStartNodeSame)GraphDefinitionprivate
construct_graph(edge_t *edges, bool has_rcost, bool directed)GraphDefinition
construct_path(int64_t ed_id, int64_t v_pos)GraphDefinitionprivate
deleteall()GraphDefinitionprivate
explore(int64_t cur_node, GraphEdgeInfo &cur_edge, bool isStart, LongVector &vecIndex, std::priority_queue< PDP, std::vector< PDP >, std::greater< PDP > > &que)GraphDefinitionprivate
get_single_cost(double total_cost, path_element_t **path, size_t *path_count)GraphDefinitionprivate
getRestrictionCost(int64_t cur_node, GraphEdgeInfo &new_edge, bool isStart)GraphDefinitionprivate
GraphDefinition(edge_t *edges, unsigned int edge_count, bool directed, bool has_rcost)GraphDefinition
GraphEdgeVector typedefGraphDefinitionprivate
init()GraphDefinitionprivate
isEndVirtualGraphDefinitionprivate
isStartVirtualGraphDefinitionprivate
Long2LongMap typedefGraphDefinitionprivate
Long2LongVectorMap typedefGraphDefinitionprivate
LongVector typedefGraphDefinitionprivate
m_bIsGraphConstructedGraphDefinitionprivate
m_bIsturnRestrictOnGraphDefinitionprivate
m_dCostGraphDefinitionprivate
m_dEndPartGraphDefinitionprivate
m_dStartpartGraphDefinitionprivate
m_edge_countGraphDefinitionprivate
m_lEndEdgeIdGraphDefinitionprivate
m_lStartEdgeIdGraphDefinitionprivate
m_mapEdgeId2IndexGraphDefinitionprivate
m_mapNodeId2EdgeGraphDefinitionprivate
m_ruleTableGraphDefinitionprivate
m_vecEdgeVectorGraphDefinitionprivate
m_vecPathGraphDefinitionprivate
max_edge_idGraphDefinitionprivate
max_node_idGraphDefinitionprivate
my_dijkstra(int64_t start_vertex, int64_t end_vertex, path_element_t **path, size_t *path_count, std::ostringstream &log)GraphDefinition
parentGraphDefinitionprivate
PDP typedefGraphDefinitionprivate
PIB typedefGraphDefinitionprivate
RuleTable typedefGraphDefinitionprivate
set_restrictions(int64_t start_vertex, int64_t end_vertex, std::vector< PDVI > &ruleList)GraphDefinition
VectorOfLongVector typedefGraphDefinitionprivate
~GraphDefinition(void)GraphDefinition