spanningForestPrim.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_SPANNING_FOREST_PRIM_H
#define GUM_SPANNING_FOREST_PRIM_H

#include <agrum/core/priorityQueue.h>
#include <agrum/graphs/algorithms/spanningForest.h>

namespace gum {

  /* ===========================================================================
   */
  /* ===========================================================================
   */
  class SpanningForestPrim : public SpanningForest {
    public:
    // ############################################################################
    // ############################################################################


    SpanningForestPrim(const UndiGraph*             graph,
                       const EdgeProperty< float >* costTable);

    SpanningForestPrim(const SpanningForestPrim& toCopy);

    virtual ~SpanningForestPrim();


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


    const EdgeSet& edgesInSpanningForest();


    const UndiGraph& spanningForest();


    float costOfSpanningForest();


    private:
    const UndiGraph& __graph;

    const EdgeProperty< float >& __costTable;

    PriorityQueue< Edge, float > __edgesToExplore;

    UndiGraph __spanning_tree;

    float __spanning_tree_cost;

    bool __require_computation;

    void __compute();

    void __computeInAComponent(const NodeId id);

    void __exploreNode(const NodeId id);

    SpanningForestPrim& operator=(const SpanningForestPrim& toCopy);
  };

} /* namespace gum */

#endif /* GUM_SPANNING_FOREST_PRIM_H */