 |
PGROUTING
3.2
|
|
PGROUTING
3.2
|
This is the complete list of members for GraphDefinition, including all inherited members.
| addEdge(edge_t edgeIn) | GraphDefinition | private |
| connectEdge(GraphEdgeInfo &firstEdge, GraphEdgeInfo &secondEdge, bool bIsStartNodeSame) | GraphDefinition | private |
| construct_graph(edge_t *edges, size_t edge_count, bool has_reverse_cost, bool directed) | GraphDefinition | |
| construct_path(int64 ed_id, int64 v_pos) | GraphDefinition | private |
| deleteall() | GraphDefinition | private |
| explore(int64 cur_node, GraphEdgeInfo &cur_edge, bool isStart, LongVector &vecIndex, std::priority_queue< PDP, std::vector< PDP >, std::greater< PDP > > &que) | GraphDefinition | private |
| get_single_cost(double total_cost, path_element_tt **path, size_t *path_count) | GraphDefinition | private |
| getRestrictionCost(int64 cur_node, GraphEdgeInfo &new_edge, bool isStart) | GraphDefinition | private |
| GraphDefinition(void) | GraphDefinition | |
| init() | GraphDefinition | private |
| isEndVirtual | GraphDefinition | private |
| isStartVirtual | GraphDefinition | private |
| m_bIsGraphConstructed | GraphDefinition | private |
| m_bIsturnRestrictOn | GraphDefinition | private |
| m_dCost | GraphDefinition | private |
| m_dEndPart | GraphDefinition | private |
| m_dStartpart | GraphDefinition | private |
| m_lEndEdgeId | GraphDefinition | private |
| m_lStartEdgeId | GraphDefinition | private |
| m_mapEdgeId2Index | GraphDefinition | private |
| m_mapNodeId2Edge | GraphDefinition | private |
| m_ruleTable | GraphDefinition | private |
| m_vecEdgeVector | GraphDefinition | private |
| m_vecPath | GraphDefinition | private |
| max_edge_id | GraphDefinition | private |
| max_node_id | GraphDefinition | private |
| my_dijkstra1(edge_t *edges, size_t edge_count, int64 start_edge, double start_part, int64 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 | |
| my_dijkstra2(edge_t *edges, size_t edge_count, int64 start_vertex, int64 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_dijkstra3(edge_t *edges, size_t edge_count, int64 start_vertex, int64 end_vertex, bool directed, bool has_reverse_cost, path_element_tt **path, size_t *path_count, char **err_msg) | GraphDefinition | |
| parent | GraphDefinition | private |
| ~GraphDefinition(void) | GraphDefinition |
1.8.17