A point in the route graph. More...

#include <route_protected.h>

Data Fields
struct route_graph_point *	hash_next

struct route_graph_segment *	start

struct route_graph_segment *	end

struct route_graph_segment *	seg

struct fibheap_el *	el

int	value

int	rhs

int	dst_val

struct route_graph_segment *	dst_seg

struct coord	c

int	flags

Detailed Description

A point in the route graph.

This represents a point in the route graph. A point usually connects two or more segments, but there are also points which don't do that (e.g. at the end of a dead-end).

Field Documentation

◆ c

struct coord route_graph_point::c

Coordinates of this point

Referenced by is_turn_allowed(), route_graph_add_segment(), route_graph_clone_segment(), route_graph_process_restriction_segment(), route_graph_segment_match(), route_graph_set_traffic_distortion(), route_path_add_item_from_graph(), rp_attr_get(), rp_coord_get(), traffic_message_add_segments(), and traffic_route_flood_graph().

◆ dst_seg

struct route_graph_segment* route_graph_point::dst_seg

For points close to the destination, this is the segment over which the destination can be reached directly

Referenced by route_graph_init(), and route_graph_reset().

◆ dst_val

int route_graph_point::dst_val

For points close to the destination, this is the cost of the point if it is the last in the graph; INT_MAX for all other points.

Referenced by route_graph_init(), and route_graph_reset().

◆ el

struct fibheap_el* route_graph_point::el

When this point is put on a Fibonacci heap, this is a pointer to this point's heap element

Referenced by route_graph_compute_shortest_path(), route_graph_init(), route_graph_reset(), and traffic_route_flood_graph().

◆ end

struct route_graph_segment* route_graph_point::end

Pointer to a list of segments of which this pointer is the end. The links of this linked-list are in route_graph_segment->end_next.

Referenced by route_get_traffic_distortion(), route_graph_add_segment(), route_graph_compute_shortest_path(), route_graph_point_is_endpoint_candidate(), route_graph_remove_traffic_distortion(), route_path_new(), rp_iterator_end(), rp_iterator_next(), traffic_route_append(), and traffic_route_prepend().

◆ flags

int route_graph_point::flags

Flags for this point (e.g. traffic distortion)

Referenced by route_graph_add_traffic_distortion(), route_graph_add_turn_restriction(), route_graph_process_restrictions(), route_graph_remove_traffic_distortion(), route_graph_set_traffic_distortion(), route_value_seg(), traffic_message_add_segments(), and traffic_route_get_seg_cost().

◆ hash_next

struct route_graph_point* route_graph_point::hash_next

Pointer to a chained hashlist of all route_graph_points with this hash

Referenced by route_graph_free_points(), route_graph_get_point_last(), route_graph_process_restrictions(), route_graph_reset(), and rp_get_item().

◆ rhs

int route_graph_point::rhs

Lookahead value based on neighbors’ value; used for recalculation and equal to value after the route graph has been flooded.

Referenced by route_graph_compute_shortest_path(), route_graph_init(), and route_graph_reset().

◆ seg

struct route_graph_segment* route_graph_point::seg

Pointer to the segment one should use to reach the destination at least costs

Referenced by route_get_traffic_distortion(), route_graph_init(), route_graph_point_is_endpoint_candidate(), route_graph_point_update(), route_graph_reset(), route_path_new(), route_segment_data_field_pos(), route_value_seg(), rp_coord_get(), traffic_message_add_segments(), traffic_point_match_segment_attributes(), traffic_route_flood_graph(), and traffic_route_prepend().

◆ start

struct route_graph_segment* route_graph_point::start

Pointer to a list of segments of which this point is the start. The links of this linked-list are in route_graph_segment->start_next.

Referenced by route_get_traffic_distortion(), route_graph_add_segment(), route_graph_compute_shortest_path(), route_graph_get_segment(), route_graph_point_is_endpoint_candidate(), route_graph_remove_traffic_distortion(), route_graph_segment_is_duplicate(), route_graph_set_traffic_distortion(), route_path_new(), traffic_point_match_segment_attributes(), and traffic_route_prepend().

◆ value

int route_graph_point::value

The cost at which one can reach the destination from this point on. INT_MAX indicates that the destination is unreachable from this point, or that this point has not yet been examined.

Referenced by route_graph_compute_shortest_path(), route_graph_init(), route_graph_point_update(), route_graph_reset(), route_path_new(), traffic_message_add_segments(), traffic_route_append(), traffic_route_flood_graph(), and traffic_route_prepend().

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

route_protected.h

Data Fields