A homogeneous binary relation R ⊆ V × V on a vertex set V is a directed graph: each ordered pair (u, v) with R(u, v) == true is an edge. More...

Concept definition

template<typename R, typename V>

concept dedekind::category::IsDirectedGraph = IsBinaryRelation<R, V, V>

dedekind::category::IsBinaryRelation

A type R is a binary relation A × B → bool if it is callable on A and B and yields a boolean.

Definition cartesian.cppm:975

dedekind::category::IsDirectedGraph

A homogeneous binary relation R ⊆ V × V on a vertex set V is a directed graph: each ordered pair (u,...

Definition cartesian.cppm:1220

Detailed Description

A homogeneous binary relation R ⊆ V × V on a vertex set V is a directed graph: each ordered pair (u, v) with R(u, v) == true is an edge.

Just IsBinaryRelation on a homogeneous carrier — the structural shape is the relation; no extra trait registration is required to call something a "directed graph" (the generality is the point).