Fast map matching  0.1.0
Classes | Typedefs
FMM::NETWORK Namespace Reference

Classes related with network and graph. More...

Classes

struct  Edge
 Road edge class. More...
 
struct  EdgeProperty
 Road edge property. More...
 
class  Heap
 Heap data structure used in the routing query More...
 
struct  HeapNode
 Node in the heap structure. More...
 
class  Network
 Road network class. More...
 
class  NetworkGraph
 Graph class of the network. More...
 
class  NodeTree
 NodeRtree wrapper for the boost node rtree. More...
 

Typedefs

typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS, boost::no_property, EdgePropertyGraph_T
 Boost graph type.
 
typedef Graph_T::edge_descriptor EdgeDescriptor
 Boost graph edge type.
 
typedef boost::graph_traits< Graph_T >::vertex_iterator NodeIterator
 Boost graph node iterator.
 
typedef boost::graph_traits< Graph_T >::out_edge_iterator OutEdgeIterator
 Boost graph out edge iterator.
 
typedef std::unordered_map< NodeIndex, NodeIndexPredecessorMap
 Predecessor Map. More...
 
typedef std::unordered_map< NodeIndex, double > DistanceMap
 Distance map. More...
 
typedef std::pair< FMM::CORE::Point, unsigned int > NodeItem
 Node Rtree item class.
 
typedef boost::geometry::index::rtree< NodeItem, boost::geometry::index::quadratic< 16 > > BoostNodeRtree
 Boost node Rtree.
 
typedef int NodeID
 Node ID in the network, can be discontinuous int.
 
typedef int EdgeID
 Edge ID in the network, can be discontinuous int.
 
typedef unsigned int NodeIndex
 Node Index in the network, range from [0,num_vertices-1 ].
 
typedef unsigned int EdgeIndex
 Edge Index in the network, range from [0,num_edges-1 ].
 
typedef std::vector< NodeIDNodeIDVec
 Vector of node id.
 
typedef std::unordered_map< NodeID, NodeIndexNodeIndexMap
 Map of node index.
 
typedef std::unordered_map< EdgeID, EdgeIndexEdgeIndexMap
 Map of edge index.
 

Detailed Description

Classes related with network and graph.

Typedef Documentation

◆ DistanceMap

typedef std::unordered_map<NodeIndex,double> FMM::NETWORK::DistanceMap

Distance map.

It stores for each node, the distance visited from a source node, which is part of the shortest path routing result.

Definition at line 61 of file graph.hpp.

◆ PredecessorMap

typedef std::unordered_map<NodeIndex,NodeIndex> FMM::NETWORK::PredecessorMap

Predecessor Map.

It stores for each node, the previous node visited, which is part of the shortest path routing result.

Definition at line 55 of file graph.hpp.