![]() |
aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
|
the classes to account for structure changes in a graph More...
#include <cstdint>#include <cstring>#include <iostream>#include <string>#include <agrum/agrum.h>#include <agrum/base/graphs/parts/nodeGraphPart.h>#include <agrum/BN/learning/structureUtils/graphChange_inl.h>Go to the source code of this file.
Classes | |
| class | gum::learning::GraphChange |
| class | gum::learning::ArcAddition |
| The class for notifying learning algorithms of new arc additions. More... | |
| class | gum::learning::ArcDeletion |
| The class for notifying learning algorithms of arc removals. More... | |
| class | gum::learning::ArcReversal |
| The class for notifying learning algorithms of arc reversals. More... | |
| class | gum::learning::ArcTriangleDeletion1 |
| The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node2->node1<-node3. More... | |
| class | gum::learning::ArcTriangleDeletion2 |
| The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node1->node2<-node3. More... | |
| class | gum::learning::EdgeAddition |
| The class for notifying learning algorithms of new edge additions. More... | |
| class | gum::learning::EdgeDeletion |
| The class for notifying learning algorithms of edge removals. More... | |
| class | gum::HashFunc< learning::GraphChange > |
| the hash function for Graph Changes More... | |
| class | gum::HashFunc< learning::ArcAddition > |
| the hash function for Arc Additions More... | |
| class | gum::HashFunc< learning::ArcDeletion > |
| the hash function for Arc Deletions More... | |
| class | gum::HashFunc< learning::ArcReversal > |
| the hash function for Arc Reversals More... | |
| class | gum::HashFunc< learning::ArcTriangleDeletion1 > |
| the hash function for Arc Triangle Deletions creating a v-structure in node 1 More... | |
| class | gum::HashFunc< learning::ArcTriangleDeletion2 > |
| the hash function for Arc Triangle Deletions creating a v-structure in node 2 More... | |
| class | gum::HashFunc< learning::EdgeAddition > |
| the hash function for Edge Additions More... | |
| class | gum::HashFunc< learning::EdgeDeletion > |
| the hash function for Edge Deletions More... | |
Namespaces | |
| namespace | gum |
| gum is the global namespace for all aGrUM entities | |
| namespace | gum::learning |
| include the inlined functions if necessary | |
Typedefs | |
| using | gum::learning::LearnNodeId = uint32_t |
| the internal type of the nodes involved in the arc/edge modifications | |
Enumerations | |
| enum class | gum::learning::GraphChangeType : LearnNodeId { gum::learning::ARC_ADDITION , gum::learning::ARC_DELETION , gum::learning::ARC_REVERSAL , gum::learning::ARC_TRIANGLE_DELETION1 , gum::learning::ARC_TRIANGLE_DELETION2 , gum::learning::EDGE_ADDITION , gum::learning::EDGE_DELETION } |
| the type of modification that can be applied to the graph More... | |
Functions | |
| std::ostream & | gum::learning::operator<< (std::ostream &stream, const GraphChange &change) |
a << operator for GraphChanges | |
the classes to account for structure changes in a graph
The classes included in this file shall be used by learning algorithms to notify scores, structural constraints, etc, how the learnt graph has been modified.
Definition in file graphChange.h.