aGrUM 3.0.0
a C++ library for (probabilistic) graphical models
gum::GUM_NodeGraphable Concept Reference

Concept for any graph that exposes node-level queries. More...

#include <graphConcepts.h>

Concept definition

template< typename T >
concept GUM_NodeGraphable = requires(const T g, NodeId id) {
{ g.existsNode(id) } -> std::convertible_to< bool >;
{ g.size() } -> std::convertible_to< Size >;
{ g.empty() } -> std::convertible_to< bool >;
}
Concept for any graph that exposes node-level queries.
Size NodeId
Type for node ids.

Detailed Description

Concept for any graph that exposes node-level queries.

Satisfied by every aGrUM graph class (DiGraph, UndiGraph, MixedGraph, DAG, PDAG, …) since they all inherit from NodeGraphPart.

Definition at line 74 of file graphConcepts.h.