aGrUM  0.14.2
spanningForest.h
Go to the documentation of this file.
1 /***************************************************************************
2  * Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN *
3  * {prenom.nom}_at_lip6.fr *
4  * *
5  * This program is free software; you can redistribute it and/or modify *
6  * it under the terms of the GNU General Public License as published by *
7  * the Free Software Foundation; either version 2 of the License, or *
8  * (at your option) any later version. *
9  * *
10  * This program is distributed in the hope that it will be useful, *
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13  * GNU General Public License for more details. *
14  * *
15  * You should have received a copy of the GNU General Public License *
16  * along with this program; if not, write to the *
17  * Free Software Foundation, Inc., *
18  * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19  ***************************************************************************/
25 #ifndef GUM_SPANNING_FOREST_H
26 #define GUM_SPANNING_FOREST_H
27 #include <agrum/agrum.h>
28 
30 #include <agrum/graphs/undiGraph.h>
31 
32 namespace gum {
33 
34  /* ===========================================================================
35  */
38  /* ===========================================================================
39  */
41  public:
42  // ############################################################################
44  // ############################################################################
46 
48  virtual ~SpanningForest();
49 
51 
52  // ############################################################################
54  // ############################################################################
56 
58 
59  virtual const EdgeSet& edgesInSpanningForest() = 0;
60 
62 
63  virtual const UndiGraph& spanningForest() = 0;
64 
66 
67  virtual float costOfSpanningForest() = 0;
68 
70 
71  protected:
72  // ############################################################################
74  // ############################################################################
76 
78 
81 
83  SpanningForest(const SpanningForest& toCopy);
84 
86 
88  SpanningForest& operator=(const SpanningForest& toCopy);
89 
91  };
92 
93 } /* namespace gum */
94 
95 #endif /* GUM_SPANNING_FOREST_H */
SpanningForest()
default constructor
SpanningForest & operator=(const SpanningForest &toCopy)
Copy operator.
virtual ~SpanningForest()
Destructor.
Base classes for undirected graphs.
gum is the global namespace for all aGrUM entities
Definition: agrum.h:25
virtual const EdgeSet & edgesInSpanningForest()=0
Returns the edges in a min cost spanning forest.
virtual float costOfSpanningForest()=0
Returns the cost of the spanning forest.
Base class for undirected graphs.
Definition: undiGraph.h:106
virtual const UndiGraph & spanningForest()=0
Construct the spanning forest.
Base class for computing min cost spanning trees or forests.
some utils for topology : NodeId, Edge, Arc and consorts ...