62#ifndef GUM_GRAPH_MORALIZATION_H
63#define GUM_GRAPH_MORALIZATION_H
73 inline void _marryParents_(
const NodeSet& parents, UndiGraph& g);
95 template < GUM_DiGraphable G >
115 template < GUM_DiGraphable G >
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
Base classes for mixed directed/undirected graphs.
UndiGraph moralizedAncestralGraph(const G &g, const NodeSet &query)
Returns the moralized ancestral graph of query in g.
UndiGraph moralGraph(const G &g)
Returns the moral graph of g.