![]() |
Eclipse SUMO - Simulation of Urban MObility
|
#include <config.h>#include <vector>#include <unordered_set>#include <math.h>#include <cmath>#include <limits>#include <stdexcept>#include <string>#include <cinttypes>#include <utility>#include <cassert>Go to the source code of this file.
Data Structures | |
| class | KDTreePartition< E, N, V > |
| Partitions the router's network wrt a k-d tree subdivision scheme. More... | |
| class | KDTreePartition< E, N, V >::Cell |
| Represents an element of the node partition (i.e. a node set) More... | |
| class | KDTreePartition< E, N, V >::NodeXComparator |
| class | KDTreePartition< E, N, V >::NodeYComparator |
Macros | |
| #define | KDTP_EXCLUDE_INTERNAL_EDGES |
| #define | KDTP_KEEP_BOUNDARY_FROM_NODES |
| #define | KDTP_KEEP_INCOMING_BOUNDARY_EDGES |
| #define | KDTP_KEEP_OUTGOING_BOUNDARY_EDGES |
Definition in file KDTreePartition.h.
| #define KDTP_EXCLUDE_INTERNAL_EDGES |
Definition at line 35 of file KDTreePartition.h.
| #define KDTP_KEEP_BOUNDARY_FROM_NODES |
Definition at line 45 of file KDTreePartition.h.
| #define KDTP_KEEP_INCOMING_BOUNDARY_EDGES |
Definition at line 40 of file KDTreePartition.h.
| #define KDTP_KEEP_OUTGOING_BOUNDARY_EDGES |
Definition at line 38 of file KDTreePartition.h.