Easy_rider/RoadGenerator_8h_source.html

#ifndef ROAD_GENERATOR_H

#define ROAD_GENERATOR_H


#include "Graph.h"

#include "Intersection.h"

#include "Road.h"


class RoadGenerator {

public:

  virtual ~RoadGenerator() = default;


  virtual void generate(Graph<Intersection, Road> &graph) = 0;


protected:

  static double euclid(const Intersection &a, const Intersection &b);

};


#endif // ROAD_GENERATOR_H

Graph.h
A generic Graph template parameterized on Node and Edge types.

Intersection.h
Declaration of the Intersection class representing a point in 2D space.

Road.h
Declaration of the Road class representing a connection between two Intersections.

Graph
A templated graph storing nodes of type T and edges of type U.
Definition Graph.h:58

Intersection
Represents a point (intersection) in a 2D coordinate system.
Definition Intersection.h:16

RoadGenerator
Abstract base class for generating roads on a Graph<Intersection,Road>.
Definition RoadGenerator.h:11

RoadGenerator::euclid
static double euclid(const Intersection &a, const Intersection &b)
Compute the Euclidean distance between two intersections.
Definition RoadGenerator.cpp:4

RoadGenerator::generate
virtual void generate(Graph< Intersection, Road > &graph)=0
Append new bidirectional roads into the graph (no duplicates).