FrankE
e6329e1db4
deleting from the grid is now bleaching fast added new helper methods many new test-cases many new methods for geo classes and others added a bunch of new grid-walkers
77 lines
2.0 KiB
C++
77 lines
2.0 KiB
C++
#ifndef DIJKSTRANODE_H
|
|
#define DIJKSTRANODE_H
|
|
|
|
/**
|
|
* wrapper around a user data structure
|
|
* adds additional fields needed for dijkstra calculation
|
|
*/
|
|
template <typename T> struct DijkstraNode {
|
|
|
|
/** pos infinity */
|
|
static constexpr float INF = +99999999;
|
|
|
|
/** the user-element this node describes */
|
|
const T* element;
|
|
|
|
/** the previous dijkstra node (navigation path) */
|
|
DijkstraNode<T>* previous;
|
|
|
|
/** the weight from the start up to this element */
|
|
float cumWeight;
|
|
|
|
|
|
/** ctor */
|
|
DijkstraNode(const T* element) : element(element), previous(), cumWeight(INF) {;}
|
|
|
|
|
|
// /** equal? (bi-dir) */
|
|
// bool operator == (const DijkstraNode<T>& other) const {
|
|
// return element == other.element;
|
|
// }
|
|
|
|
};
|
|
|
|
/**
|
|
* data structure describing the connection between two nodes.
|
|
* NOTE: only used to track already processed connections!
|
|
*/
|
|
template <typename T> struct DijkstraEdge {
|
|
|
|
/** the edge's source */
|
|
const DijkstraNode<T>* src;
|
|
|
|
/** the edge's destination */
|
|
const DijkstraNode<T>* dst;
|
|
|
|
/** ctor */
|
|
DijkstraEdge(const DijkstraNode<T>* src, const DijkstraNode<T>* dst) : src(src), dst(dst) {;}
|
|
|
|
/** equal? (bi-directional! edge direction does NOT matter) */
|
|
bool operator == (const DijkstraEdge& other) const {
|
|
return ((dst == other.dst) && (src == other.src)) ||
|
|
((src == other.dst) && (dst == other.src));
|
|
}
|
|
|
|
// std::set was slower than std::unordered_set
|
|
// bool operator < (const DijkstraEdge& other) const {
|
|
// return ((size_t)src * (size_t)dst) < ((size_t)other.src * (size_t)other.dst);
|
|
// }
|
|
|
|
};
|
|
|
|
/** allows adding DijkstraEdge<T> to hash-maps */
|
|
namespace std {
|
|
template <typename T> struct hash<DijkstraEdge<T>>{
|
|
size_t operator()(const DijkstraEdge<T>& e) const {
|
|
|
|
// dunno why but this one provided the fastet results even though
|
|
// this should lead to the most hash-collissions?!
|
|
return hash<size_t>()( std::min((size_t)e.src, (size_t)e.dst) );
|
|
//return hash<size_t>()( (size_t)e.src * (size_t)e.dst );
|
|
|
|
}
|
|
};
|
|
}
|
|
|
|
#endif // DIJKSTRANODE_H
|