34 lines
889 B
C++
34 lines
889 B
C++
// Copyright 2018, University of Freiburg,
|
|
// Chair of Algorithms and Data Structures.
|
|
// Authors: Patrick Brosi <brosi@informatik.uni-freiburg.de>
|
|
|
|
#ifndef PFAEDLE_TRGRAPH_GRAPH_H_
|
|
#define PFAEDLE_TRGRAPH_GRAPH_H_
|
|
|
|
#include "pfaedle/trgraph/NodePL.h"
|
|
#include "pfaedle/trgraph/EdgePL.h"
|
|
#include "util/graph/UndirGraph.h"
|
|
#include "util/graph/DirGraph.h"
|
|
#include "util/geo/Grid.h"
|
|
|
|
using util::geo::Grid;
|
|
using util::geo::Point;
|
|
using util::geo::Line;
|
|
|
|
namespace pfaedle {
|
|
namespace trgraph {
|
|
|
|
/*
|
|
* A graph for physical transit networks
|
|
*/
|
|
typedef util::graph::Edge<NodePL, EdgePL> Edge;
|
|
typedef util::graph::Node<NodePL, EdgePL> Node;
|
|
typedef util::graph::DirGraph<NodePL, EdgePL> Graph;
|
|
typedef Grid<Node*, Point, PFAEDLE_PRECISION> NodeGrid;
|
|
typedef Grid<Edge*, Line, PFAEDLE_PRECISION> EdgeGrid;
|
|
|
|
} // namespace trgraph
|
|
} // namespace pfaedle
|
|
|
|
#endif // PFAEDLE_TRGRAPH_GRAPH_H_
|