PGROUTING  2.5
 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.

addEdge(edge edgeIn)GraphDefinitionprivate
connectEdge(GraphEdgeInfo &firstEdge, GraphEdgeInfo &secondEdge, bool bIsStartNodeSame)GraphDefinitionprivate
construct_graph(edge_t *edges, size_t edge_count, bool has_reverse_cost, bool directed)GraphDefinition
construct_path(long ed_id, long v_pos)GraphDefinitionprivate
deleteall()GraphDefinitionprivate
explore(long 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_tt **path, size_t *path_count)GraphDefinitionprivate
getRestrictionCost(long cur_node, GraphEdgeInfo &new_edge, bool isStart)GraphDefinitionprivate
GraphDefinition(void)GraphDefinition
init()GraphDefinitionprivate
isEndVirtualGraphDefinitionprivate
isStartVirtualGraphDefinitionprivate
m_bIsGraphConstructedGraphDefinitionprivate
m_bIsturnRestrictOnGraphDefinitionprivate
m_dCostGraphDefinitionprivate
m_dEndPartGraphDefinitionprivate
m_dStartpartGraphDefinitionprivate
m_lEndEdgeIdGraphDefinitionprivate
m_lStartEdgeIdGraphDefinitionprivate
m_mapEdgeId2IndexGraphDefinitionprivate
m_mapNodeId2EdgeGraphDefinitionprivate
m_ruleTableGraphDefinitionprivate
m_vecEdgeVectorGraphDefinitionprivate
m_vecPathGraphDefinitionprivate
max_edge_idGraphDefinitionprivate
max_node_idGraphDefinitionprivate
multi_dijkstra(edge_t *edges, size_t edge_count, std::vector< int > vertices, bool directed, bool has_reverse_cost, path_element_tt **path, size_t *path_count, char **err_msg, std::vector< PDVI > &ruleList)GraphDefinition
my_dijkstra(long start_vertex, long end_vertex, size_t edge_count, char **err_msg)GraphDefinition
my_dijkstra(edge_t *edges, size_t edge_count, long start_vertex, long end_vertex, bool directed, bool has_reverse_cost, path_element_tt **path, size_t *path_count, char **err_msg)GraphDefinition
my_dijkstra(edge_t *edges, size_t edge_count, long start_vertex, long end_vertex, bool directed, bool has_reverse_cost, path_element_tt **path, size_t *path_count, char **err_msg, std::vector< PDVI > &ruleList)GraphDefinition
my_dijkstra(edge_t *edges, size_t edge_count, long start_edge, double start_part, long end_edge, double end_part, bool directed, bool has_reverse_cost, path_element_tt **path, size_t *path_count, char **err_msg, std::vector< PDVI > &ruleList)GraphDefinition
parentGraphDefinitionprivate
~GraphDefinition(void)GraphDefinition