dsf::mobility Namespace Reference

Classes
class	Agent
	The Agent class represents an agent in the network. More...
class	FirstOrderDynamics
class	Intersection
	The Intersection class represents a node in the network. More...
class	Itinerary
	The Itinerary class represents an itinerary in the network. More...
class	PathCollection
class	Road
	The Road class represents a road in the network. More...
class	RoadDynamics
	The RoadDynamics class represents the dynamics of the network. More...
class	RoadJunction
class	RoadNetwork
	The RoadNetwork class represents a graph in the network. More...
class	Roundabout
	The Roundabout class represents a roundabout node in the network. More...
class	Counter
	The Counter class is used to count events. More...
class	Station
class	AgentComparator
class	Street
	The Street class represents a street in the network. More...
class	TrafficLightCycle
class	TrafficLight

Enumerations
enum class	RoadType : std::uint8_t {   HIGHWAY = 0 , PRIMARY = 1 , SECONDARY = 2 , TERTIARY = 3 ,   RESIDENTIAL = 4 }
enum class	RoadStatus : std::uint8_t { OPEN = 0 , CLOSED = 1 }
enum class	CounterPosition : uint8_t { ENTRY = 0 , MIDDLE = 1 , EXIT = 2 }
	The position of the counter on the street.

Detailed Description

This file contains the definition of the Intersection class. The Intersection class represents a node in the road network. It is derived from the Node class and has a multimap of agents waiting to pass through the intersection. Agents are ordered by their angle difference, emulating real-world precedence.

This file contains the definition of the Roundabout class. The Roundabout class represents a roundabout node in the road network. It is derived from the Node class and has a queue of agents waiting to exit the roundabout.

This file contains the definition of the TrafficLightCycle and TrafficLight classes. The TrafficLightCycle class represents a cycle of a traffic light, with a green time and a phase. The TrafficLight class represents a traffic light intersection node in the road network. It is derived from the Intersection class and has a map of cycles for each street queue.