63f0b61ea1
Changes: * support for multiple GTFS feeds as input in filtering, read default global and local configuration files * be a bit more memory conservative * make caching optional * dont delete orphan edge if it would transform a degree 3 node with a possible full turn into a degree 2 node eligible for contraction * dedicated filters for funicular and gondola * make max snap level option more intuitive * allow filter rules for level 0 * additional fallback for station snapping * dont try to route for MOT unequal to trip in -T mode, force-snap to orphaned OSM station if not snap was possible * write bounds to filtered osm * remove unused surrounding heuristic * use bus lanes info * be a bit more tolerant for bus oneway streets * create missing directories * error if no cfg is present, clean up evaluation Makefile
40 lines
878 B
C++
40 lines
878 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"
|
|
#include "util/geo/Geo.h"
|
|
#include "pfaedle/Def.h"
|
|
|
|
using util::geograph::GeoNodePL;
|
|
|
|
|
|
namespace pfaedle {
|
|
namespace router {
|
|
|
|
class NodePL {
|
|
public:
|
|
NodePL() : _n(0) {}
|
|
NodePL(const pfaedle::trgraph::Node* n) : _n(n) {} // NOLINT
|
|
|
|
const POINT* getGeom() const {
|
|
return !_n ? 0 : _n->pl().getGeom();
|
|
}
|
|
util::json::Dict getAttrs() const {
|
|
if (_n) return _n->pl().getAttrs();
|
|
return util::json::Dict();
|
|
}
|
|
|
|
private:
|
|
const pfaedle::trgraph::Node* _n;
|
|
};
|
|
} // namespace router
|
|
} // namespace pfaedle
|
|
|
|
#endif // PFAEDLE_ROUTER_NODEPL_H_
|