DHART
Loading...
Searching...
No Matches
pathfinder_C.h
Go to the documentation of this file.
1
9#ifndef PATHFINDER_C_H
10#define PATHFINDER_C_H
11
12#include <cinterface_utils.h>
13
14#define C_INTERFACE extern "C" __declspec(dllexport) int
15
16namespace HF {
17 namespace SpatialStructures { class Graph; class Path; class PathMember; }
18 namespace Pathfinding { class BoostGraph; }
19}
20
257 int start,
258 int end,
259 const char * cost_type,
260 int* out_size,
263);
264
332 const int* start,
333 const int* end,
334 const char * cost_type,
335 HF::SpatialStructures::Path** out_path_ptr_holder,
336 HF::SpatialStructures::PathMember** out_path_member_ptr_holder,
337 int* out_sizes,
338 int num_paths
339);
340
367 HF::SpatialStructures::PathMember** out_member_ptr,
368 int* out_size
369);
370
393
448 const char * cost_type,
449 HF::SpatialStructures::Path** out_path_ptr_holder,
450 HF::SpatialStructures::PathMember** out_path_member_ptr_holder,
451 int* out_sizes,
452 int num_paths
453);
454
504 const char * cost_name,
505 std::vector<float>** out_dist_vector,
506 float** out_dist_data,
507 std::vector<int>** out_pred_vector,
508 int** out_pred_data
509);
510
513#endif /* PATHFINDER_C_H */
#define C_INTERFACE
Definition: pathfinder_C.h:14
C_INTERFACE CalculateDistanceAndPredecessor(const HF::SpatialStructures::Graph *g, const char *cost_name, std::vector< float > **out_dist_vector, float **out_dist_data, std::vector< int > **out_pred_vector, int **out_pred_data)
Calculate the distance and predecessor matricies for a graph.
C_INTERFACE CreatePath(const HF::SpatialStructures::Graph *g, int start, int end, const char *cost_type, int *out_size, HF::SpatialStructures::Path **out_path, HF::SpatialStructures::PathMember **out_data)
Find the shortest path from start to end.
C_INTERFACE DestroyPath(HF::SpatialStructures::Path *path_to_destroy)
Delete a path.
C_INTERFACE GetPathInfo(HF::SpatialStructures::Path *p, HF::SpatialStructures::PathMember **out_member_ptr, int *out_size)
Get the size of a path and a pointer to its path members.
C_INTERFACE CreateAllToAllPaths(const HF::SpatialStructures::Graph *g, const char *cost_type, HF::SpatialStructures::Path **out_path_ptr_holder, HF::SpatialStructures::PathMember **out_path_member_ptr_holder, int *out_sizes, int num_paths)
Find a path from every node in a graph to every other node.
C_INTERFACE CreatePaths(const HF::SpatialStructures::Graph *g, const int *start, const int *end, const char *cost_type, HF::SpatialStructures::Path **out_path_ptr_holder, HF::SpatialStructures::PathMember **out_path_member_ptr_holder, int *out_sizes, int num_paths)
Find multiple shortest paths in paralllel.
Perform human scale analysis on 3D environments.
A Graph of nodes connected by edges that supports both integers and HF::SpatialStructures::Node.
Definition: graph.h:486
The ID of a node, and the cost cost to the node after it.
Definition: path.h:19
A collection of nodes that form a path.
Definition: path.h:76