37 lines
860 B
C
37 lines
860 B
C
|
// Copyright 2018, University of Freiburg,
|
||
|
|
// Chair of Algorithms and Data Structures.
|
||
|
|
// Authors: Patrick Brosi <brosi@informatik.uni-freiburg.de>
|
||
|
|
|
||
|
|
#ifndef PFAEDLE_ROUTER_NODEPL_H_
|
||
|
|
#define PFAEDLE_ROUTER_NODEPL_H_
|
||
|
|
|
||
|
|
#include <map>
|
||
|
|
#include <string>
|
||
|
|
#include "pfaedle/trgraph/Graph.h"
|
||
|
|
#include "util/geo/GeoGraph.h"
|
||
|
|
|
||
|
|
using util::geograph::GeoNodePL;
|
||
|
|
|
||
|
|
namespace pfaedle {
|
||
|
|
namespace router {
|
||
|
|
|
||
|
|
class NodePL : public GeoNodePL<float> {
|
||
|
|
public:
|
||
|
|
NodePL() : _n(0) {}
|
||
|
|
NodePL(const pfaedle::trgraph::Node* n) : _n(n) {} // NOLINT
|
||
|
|
|
||
|
|
const util::geo::FPoint* getGeom() const {
|
||
|
|
return !_n ? 0 : _n->pl().getGeom();
|
||
|
|
}
|
||
|
|
void getAttrs(std::map<std::string, std::string>* attrs) const {
|
||
|
|
if (_n) _n->pl().getAttrs(attrs);
|
||
|
|
}
|
||
|
|
|
||
|
|
private:
|
||
|
|
const pfaedle::trgraph::Node* _n;
|
||
|
|
};
|
||
|
|
} // namespace router
|
||
|
|
} // namespace pfaedle
|
||
|
|
|
||
|
|
#endif // PFAEDLE_ROUTER_NODEPL_H_
|