mixedGraph.h

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN  *
 *   {prenom.nom}_at_lip6.fr                                               *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program is distributed in the hope that it will be useful,       *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
 *   GNU General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/
#ifndef GUM_MIXED_GRAPH_H
#define GUM_MIXED_GRAPH_H

#include <iostream>
#include <utility>

#include <agrum/agrum.h>

#include <agrum/graphs/diGraph.h>
#include <agrum/graphs/undiGraph.h>

namespace gum {

  /* ===========================================================================
   */
  /* ===      BASE CLASS FOR MANIPULATING GRAPHS WITH BOTH EDGES AND ARCS    ===
   */
  /* ===========================================================================
   */
  /* ===========================================================================
   */

  class MixedGraph
      : public virtual UndiGraph
      , public virtual DiGraph {
    public:
    // ############################################################################
    // ############################################################################


    explicit MixedGraph(Size nodes_size = HashTableConst::default_size,
                        bool nodes_resize_policy = true,
                        Size arcs_size = HashTableConst::default_size,
                        bool arcs_resize_policy = true,
                        Size edges_size = HashTableConst::default_size,
                        bool edges_resize_policy = true);


    MixedGraph(const MixedGraph& g);

    virtual ~MixedGraph();


    // ############################################################################
    // ############################################################################


    MixedGraph& operator=(const MixedGraph& g);


    // not virtual : it is a feature !!! :)
    bool operator==(const MixedGraph& g) const;


    // not virtual : it is a feature !!! :)
    bool operator!=(const MixedGraph& g) const;


    // ############################################################################
    // ############################################################################


    virtual void eraseNode(const NodeId id);

    virtual void clear();

    const std::vector< NodeId > mixedOrientedPath(const NodeId node1,
                                                  const NodeId node2) const;


    const std::vector< NodeId > mixedUnorientedPath(const NodeId node1,
                                                    const NodeId node2) const;

    virtual const std::string toDot() const;

    virtual const std::string toString() const;

  };

  std::ostream& operator<<(std::ostream&, const MixedGraph&);

} /* namespace gum */

#ifndef GUM_NO_INLINE
#  include <agrum/graphs/mixedGraph_inl.h>
#endif   // GUM_NOINLINE

#endif /* GUM_MIXEDGRAPH_H */