![]() |
aGrUM 3.3.2
a C++ library for (probabilistic) graphical models
|
Generic algorithms come in two flavors: approximation schemes/policies (see the Topics below) and a family of graph algorithms genericized via C++20 concepts, detailed in the section below. More...
Topics | |
| Approximation Scheme algorithms | |
| About aGrUM approximation schemes. | |
| Approximation algorithms | |
| About aGrUM approximation policies. | |
Generic algorithms come in two flavors: approximation schemes/policies (see the Topics below) and a family of graph algorithms genericized via C++20 concepts, detailed in the section below.
A family of free functions in gum::graph (src/agrum/base/graphs/algorithms/generic/) is written once and generalized across concrete graph types through four C++20 concepts defined in graphConcepts.h: GUM_NodeGraphable (base), GUM_DiGraphable and GUM_UndiGraphable (both refine it), and GUM_MixedGraphable (refines both). DiGraph/DAG satisfy GUM_DiGraphable, UndiGraph satisfies GUM_UndiGraphable, MixedGraph/PDAG satisfy GUM_MixedGraphable – each checked by a compile-time static_assert.
This generalization is currently confined to src/agrum/base/graphs/: higher-level modules (BN, MRF, CN, PRM, ...) call these free functions directly rather than constraining their own templates by these concepts.