Concept that an Edge type must satisfy, given a Node type T.
More...
#include <Graph.h>
template<typename U, typename T>
{ e.getFrom() } -> std::same_as<T>;
{ e.getTo() } -> std::same_as<T>;
{ e.getLength() } -> std::same_as<double>;
{ e.getMaxSpeed() } -> std::same_as<int>;
}
Concept that an Edge type must satisfy, given a Node type T.
Definition Graph.h:42
Concept that an Edge type must satisfy, given a Node type T.
An Edge must provide:
- T getFrom()
- T getTo()
- double getLength()
- int getMaxSpeed()