aGrUM
0.14.1

▼Generic algorithms  
Approximation Scheme algorithms  About aGrUM approximation schemes 
Approximation algorithms  About aGrUM approximation policies 
▼Bayesian Networks  
Inference Algorithms  
Serialization  
Generators  
Particles Algorithms  
Credal Networks  
▼Basic data structures  
Hash Tables  A efficient and flexible implementation of hash tables 
Hash functions  This module lists all hash functions provided by aGrUM 
Bijections  Set of pairs of elements with fast search for both elements 
Heaps  An implementation of heaps 
Lists  This file provides class List for manipulating generic lists as well as List<>::iterator, List<>::const_iterator, List<>::iterator_safe and List<>::const_iterator_safe for parsing lists 
Priority queue  This file provides class MultiPriorityQueue that is essentially a heap in which elements are sorted according to a dynamically modifiable priority 
Sequences  A Sequence<Key> is quite similar to a vector<Key> in that it stores an ordered set of elements 
Sets  A Set is a structure that contains arbitrary elements 
Splay Trees  A splay tree is a selfbalancing binary search tree 
Factored Markov Decision Process  
Graph representation  
▼Tools for learning  
Database Manipulations  
Scores and Independence Tests  
Scores A Priori  
Structural Constraints  
Parameters utilities  
▼multidimensional tables  
Operators on multidimensional tables  
Aggregators  
Function Graphs  
Patterns for multidimensional tables  
Probabilistic Relational Models  
Signaler and Listener  
▼Utilities  About aGrUM utilities 
Math  All the maths you'll need 
Configuration  About aGrUM configuration 
Smart Pointers  RefPtr are a replacement for the usual pointers: they keep track of the number of "smart" pointers pointing to a given element 