RoadNetwork.hpp File Reference

Defines the RoadNetwork class. More...

#include <algorithm>
#include <concepts>
#include <limits>
#include <memory>
#include <optional>
#include <ranges>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <type_traits>
#include <utility>
#include <string>
#include <fstream>
#include <sstream>
#include <cassert>
#include <format>
#include "AdjacencyMatrix.hpp"
#include "DijkstraWeights.hpp"
#include "Network.hpp"
#include "Intersection.hpp"
#include "TrafficLight.hpp"
#include "Roundabout.hpp"
#include "Station.hpp"
#include "Street.hpp"
#include "../utility/DijkstraResult.hpp"
#include "../utility/Logger.hpp"
#include "../utility/Typedef.hpp"
#include "../utility/TypeTraits/is_node.hpp"
#include "../utility/TypeTraits/is_street.hpp"

Classes
class	dsm::RoadNetwork
	The RoadNetwork class represents a graph in the network. More...

Namespaces
namespace	dsm

Detailed Description

Defines the RoadNetwork class.

This file contains the definition of the RoadNetwork class. The RoadNetwork class represents a graph in the network. It is templated by the type of the graph's id and the type of the graph's capacity. The graph's id and capacity must be unsigned integral types.