DHART
|
#include <pathfinder_C.h>
#include <memory>
#include <vector>
#include <HFExceptions.h>
#include <graph.h>
#include <path_finder.h>
#include <path.h>
Go to the source code of this file.
Functions | |
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. More... | |
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. More... | |
C_INTERFACE | GetPathInfo (HF::SpatialStructures::Path *p, PathMember **out_member_ptr, int *out_size) |
Get the size of a path More... | |
C_INTERFACE | DestroyPath (Path *path_to_destroy) |
Delete a path. More... | |
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. More... | |
C_INTERFACE | CalculateDistanceAndPredecessor (const Graph *g, const char *cost_name, vector< float > **out_dist_vector, float **out_dist_data, vector< int > **out_pred_vector, int **out_pred_data) |
Calculate the distance and predecessor matricies for a graph. More... | |