Go to the source code of this file.
Classes |
struct | TD_link |
struct | TD_node |
struct | TD_path |
struct | TD_queue_list |
Defines |
#define | INT_SEC_NUM 8 |
Typedefs |
typedef struct TD_link | Link |
typedef struct TD_link * | LinkPtr |
typedef struct TD_path | PathMap |
typedef struct TD_path * | PathMapPtr |
typedef struct TD_queue_list | QueueList |
typedef struct TD_queue_list ** | QueueListHandle |
typedef struct TD_queue_list * | QueueListPtr |
typedef struct TD_node | WayPoint |
typedef struct TD_node * | WayPointPtr |
Functions |
QueueListPtr | add_queue (QueueListHandle first_queue, WayPointPtr a_node) |
int | delete_link (PathMapPtr a_path, LinkPtr a_link) |
int | delete_node (PathMapPtr a_path, WayPointPtr a_node) |
void | delete_path (PathMapPtr a_path) |
void | draw_path (PathMapPtr a_path, PathMapPtr min_path) |
int | load_path_file (const char *file_name, PathMapPtr a_path) |
LinkPtr | make_link (PathMapPtr a_path, WayPointPtr node1, WayPointPtr node2, double cost) |
WayPointPtr | make_node (PathMapPtr a_path, double x, double y) |
PathMapPtr | make_path (void) |
WayPointPtr | next_queue (QueueListHandle a_queue) |
WayPointPtr | nth_node (PathMapPtr a_path, int n) |
void | print_path_info (PathMapPtr a_path) |
LinkPtr | search_nearest_link (PathMapPtr a_path, double x, double y) |
WayPointPtr | search_nearest_node (PathMapPtr a_path, double x, double y) |
void | set_goal_position (PathMapPtr a_path, double x, double y) |
void | set_start_position (PathMapPtr a_path, double x, double y) |
PathMapPtr | solve_minimum_path (PathMapPtr a_path) |
void | write_path (FILE *a_file, PathMapPtr a_path) |
Define Documentation
Typedef Documentation
Function Documentation