Dedekind 0.0.0
A structuralist C++23 Module Library
Loading...
Searching...
No Matches
dedekind::category::IsUndirectedGraph Concept Referenceexport
module dedekind.category

A directed graph R is undirected when its relation is symmetric: R(u, v) iff R(v, u). More...

Concept definition

template<typename R, typename V>
concept dedekind::category::IsUndirectedGraph = IsDirectedGraph<R, V> && IsSymmetric<V, R>
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
dedekind::category::IsSymmetric
Formal verification: Rel(a, b) ⇔ Rel(b, a).
Definition equivalence.cppm:129
dedekind::category::IsUndirectedGraph
A directed graph R is undirected when its relation is symmetric: R(u, v) iff R(v, u).
Definition cartesian.cppm:1228

Detailed Description

A directed graph R is undirected when its relation is symmetric: R(u, v) iff R(v, u).