9#include <boost/graph/graph_traits.hpp>
10#include <boost/graph/adjacency_matrix.hpp>
11#include <boost/graph/directed_graph.hpp>
12#include <boost/graph/compressed_sparse_row_graph.hpp>
13#include <boost/graph/adjacency_list.hpp>
32 template <
typename SizeT>
35 seed ^=
value + 0x9e3779b9 + (seed << 6) + (seed >> 2);
38 struct hash<
std::array<float, 3>>
53 inline std::size_t
operator()(
const std::array<float, 3>& k)
const
55 size_t seed = std::hash<float>()(k[0]);
77#ifdef BOOST_NO_EXCEPTIONS
78 inline void throw_exception(std::exception
const& e) {
88 namespace SpatialStructures {
93 namespace Pathfinding {
113 boost::compressed_sparse_row_graph<boost::directedS>
131 typedef boost::compressed_sparse_row_graph<
142 typedef std::pair <int, int>
pair;
169 std::vector<vertex_descriptor>
p;
170 std::vector<double>
d;
void array_hash_combine_impl(SizeT &seed, SizeT value)
Combine the hash of value into seed.
Perform human scale analysis on 3D environments.
Data stored for every edge in the BoostGraph.
Data stored for every vertex in the BoostGraph.
double d
Unknown may have been used for the colormap.
boost::graph_traits< graph_t >::vertex_descriptor vertex_descriptor
Quick alias to shorten the typename of vertex descriptors for our graph_t type. /summary>
boost::graph_traits< boost::compressed_sparse_row_graph< boost::directedS > >::vertex_descriptor p
The index of a vertex in the CSR.
boost::compressed_sparse_row_graph< boost::directedS, vertex_data, Edge_Cost > graph_t
Type of graph held by the BoostGraph.
std::pair< int, int > pair
Shorten std::pair to simplify graph construction.
float weight
Cost of traversing this edge.
The Boost C++ library. https://www.boost.org/.
@ value
the parser finished reading a JSON value
std::size_t operator()(const std::array< float, 3 > &k) const
Template specialization to hash an array of floats.
A graph usable with the BoostGraphLibrary.
std::vector< double > d
Distance array preallocated to the number of nodes in the graph.
graph_t g
The underlying graph in boost.
~BoostGraph()
Explicit Destructor required for BoostGraphDeleter to work in path_finder.h.
std::vector< vertex_descriptor > p
Vertex array preallocated to the number of nodes in the graph.
A Graph of nodes connected by edges that supports both integers and HF::SpatialStructures::Node.