DAGmodel.h

Go to the documentation of this file.

/****************************************************************************
 *   This file is part of the aGrUM/pyAgrum library.                        *
 *                                                                          *
 *   Copyright (c) 2005-2025 by                                             *
 *       - Pierre-Henri WUILLEMIN(_at_LIP6)                                 *
 *       - Christophe GONZALES(_at_AMU)                                     *
 *                                                                          *
 *   The aGrUM/pyAgrum library is free software; you can redistribute it    *
 *   and/or modify it under the terms of either :                           *
 *                                                                          *
 *    - the GNU Lesser General Public License as published by               *
 *      the Free Software Foundation, either version 3 of the License,      *
 *      or (at your option) any later version,                              *
 *    - the MIT license (MIT),                                              *
 *    - or both in dual license, as here.                                   *
 *                                                                          *
 *   (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html)    *
 *                                                                          *
 *   This aGrUM/pyAgrum library is distributed in the hope that it will be  *
 *   useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,          *
 *   INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
 *   FOR A PARTICULAR PURPOSE  AND NONINFRINGEMENT. IN NO EVENT SHALL THE   *
 *   AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
 *   LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,        *
 *   ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR  *
 *   OTHER DEALINGS IN THE SOFTWARE.                                        *
 *                                                                          *
 *   See LICENCES for more details.                                         *
 *                                                                          *
 *   SPDX-FileCopyrightText: Copyright 2005-2025                            *
 *       - Pierre-Henri WUILLEMIN(_at_LIP6)                                 *
 *       - Christophe GONZALES(_at_AMU)                                     *
 *   SPDX-License-Identifier: LGPL-3.0-or-later OR MIT                      *
 *                                                                          *
 *   Contact  : info_at_agrum_dot_org                                       *
 *   homepage : http://agrum.gitlab.io                                      *
 *   gitlab   : https://gitlab.com/agrumery/agrum                           *
 *                                                                          *
 ****************************************************************************/
 

#ifndef GUM_DAGMODEL_H
#define GUM_DAGMODEL_H
 
#include <agrum/agrum.h>
 
#include <agrum/base/graphicalModels/graphicalModel.h>
 
namespace gum {

  class DAGmodel: public GraphicalModel {
    public:

    DAGmodel();

    virtual ~DAGmodel();

    DAGmodel(const DAGmodel& source);



    const DAG& dag() const;

    virtual Size size() const final;

    Size sizeArcs() const;
 
    const NodeGraphPart& nodes() const final;

    bool exists(NodeId node) const final;
    bool exists(const std::string& name) const final;


    const ArcSet& arcs() const;


    bool existsArc(const NodeId tail, const NodeId head) const;
    bool existsArc(const std::string& nametail, const std::string& namehead) const;


    const NodeSet& parents(const NodeId id) const;
    const NodeSet& parents(const std::string& name) const;

    NodeSet parents(const NodeSet& ids) const;
    NodeSet parents(const std::vector< std::string >& names) const;


    NodeSet family(const NodeId id) const final;
    NodeSet family(const std::string& name) const final;


    const NodeSet& children(const NodeId id) const;
    const NodeSet& children(const std::string& name) const;

    NodeSet children(const NodeSet& ids) const;
    NodeSet children(const std::vector< std::string >& names) const;


    NodeSet descendants(const NodeId id) const;
    NodeSet descendants(const std::string& name) const;


    NodeSet ancestors(const NodeId id) const;
    NodeSet ancestors(const std::string& name) const;


    UndiGraph moralizedAncestralGraph(const NodeSet& nodes) const;
    UndiGraph moralizedAncestralGraph(const std::vector< std::string >& nodenames) const;

    bool isIndependent(NodeId X, NodeId Y, const NodeSet& Z) const final;

    bool isIndependent(const NodeSet& X, const NodeSet& Y, const NodeSet& Z) const final;
 
    bool isIndependent(const std::string&                Xname,
                       const std::string&                Yname,
                       const std::vector< std::string >& Znames) const {
      return isIndependent(idFromName(Xname), idFromName(Yname), nodeset(Znames));
    };
 
    bool isIndependent(const std::vector< std::string >& Xnames,
                       const std::vector< std::string >& Ynames,
                       const std::vector< std::string >& Znames) const {
      return isIndependent(nodeset(Xnames), nodeset(Ynames), nodeset(Znames));
    };

    UndiGraph moralGraph() const;

    Sequence< NodeId > topologicalOrder() const;

    bool hasSameStructure(const DAGmodel& other);
 
    /***
     * @return the minimal subset of soids that conditions the target
     *
     * i.e. P(target| soids)=P(target|@return)
     */
    NodeSet minimalCondSet(NodeId target, const NodeSet& soids) const;
 
 
    /***
     * @return the minimal subset of soids that conditions the targets
     *
     * i.e. P(targets| soids)=P(targets|@return)
     */
    NodeSet minimalCondSet(const NodeSet& targets, const NodeSet& soids) const;
 
 
    /***
     * @return the minimal subset of soids that conditions the target
     *
     * i.e. P(target| soids)=P(target|@return)
     */
    NodeSet minimalCondSet(const std::string&                target,
                           const std::vector< std::string >& soids) const;
 
 
    /***
     * @return the minimal subset of soids that conditions the targets
     *
     * i.e. P(targets| soids)=P(targets|@return)
     */
    NodeSet minimalCondSet(const std::vector< std::string >& targets,
                           const std::vector< std::string >& soids) const;
 
 
    protected:
    DAGmodel& operator=(const DAGmodel& source);

    DAG dag_;
  };
}   // namespace gum
 
#ifndef GUM_NO_INLINE
#  include <agrum/base/graphicalModels/DAGmodel_inl.h>
#endif /* GUM_NO_INLINE */
 
#endif /* GUM_DAGMODEL_H */