4c29892658
* better and faster trip clustering: trip tries * add --write-colors to extract line colors from OSM data * refactor config parameter names, update default pfaedle.cfg * add --stats for writing a stats.json file * add --no-fast-hops, --no-a-star, --no-trie for debugging * general refactoring
55 lines
1.6 KiB
C++
55 lines
1.6 KiB
C++
// Copyright 2016, University of Freiburg,
|
|
// Chair of Algorithms and Data Structures.
|
|
// Authors: Patrick Brosi <brosi@informatik.uni-freiburg.de>
|
|
|
|
// _____________________________________________________________________________
|
|
template <typename N, typename E>
|
|
Node<N, E>* DirGraph<N, E>::addNd(const N& pl) {
|
|
return addNd(new DirNode<N, E>(pl));
|
|
}
|
|
|
|
// _____________________________________________________________________________
|
|
template <typename N, typename E>
|
|
Node<N, E>* DirGraph<N, E>::addNd() {
|
|
return addNd(new DirNode<N, E>());
|
|
}
|
|
|
|
// _____________________________________________________________________________
|
|
template <typename N, typename E>
|
|
Node<N, E>* DirGraph<N, E>::addNd(DirNode<N, E>* n) {
|
|
auto ins = Graph<N, E>::_nodes.insert(n);
|
|
return *ins.first;
|
|
}
|
|
|
|
// _____________________________________________________________________________
|
|
template <typename N, typename E>
|
|
Edge<N, E>* DirGraph<N, E>::addEdg(Node<N, E>* from, Node<N, E>* to,
|
|
const E& p) {
|
|
Edge<N, E>* e = Graph<N, E>::getEdg(from, to);
|
|
if (!e) {
|
|
e = new Edge<N, E>(from, to, p);
|
|
from->addEdge(e);
|
|
to->addEdge(e);
|
|
}
|
|
return e;
|
|
}
|
|
|
|
// _____________________________________________________________________________
|
|
template <typename N, typename E>
|
|
Node<N, E>* DirGraph<N, E>::mergeNds(Node<N, E>* a, Node<N, E>* b) {
|
|
for (auto e : a->getAdjListOut()) {
|
|
if (e->getTo() != b) {
|
|
addEdg(b, e->getTo(), e->pl());
|
|
}
|
|
}
|
|
|
|
for (auto e : a->getAdjListIn()) {
|
|
if (e->getFrom() != b) {
|
|
addEdg(e->getFrom(), b, e->pl());
|
|
}
|
|
}
|
|
|
|
DirGraph<N, E>::delNd(a);
|
|
|
|
return b;
|
|
}
|