aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
spanningForest.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 by *
5 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
6 * - Christophe GONZALES(_at_AMU) *
7 * *
8 * The aGrUM/pyAgrum library is free software; you can redistribute it *
9 * and/or modify it under the terms of either : *
10 * *
11 * - the GNU Lesser General Public License as published by *
12 * the Free Software Foundation, either version 3 of the License, *
13 * or (at your option) any later version, *
14 * - the MIT license (MIT), *
15 * - or both in dual license, as here. *
16 * *
17 * (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18 * *
19 * This aGrUM/pyAgrum library is distributed in the hope that it will be *
20 * useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22 * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26 * OTHER DEALINGS IN THE SOFTWARE. *
27 * *
28 * See LICENCES for more details. *
29 * *
30 * SPDX-FileCopyrightText: Copyright 2005-2025 *
31 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
32 * - Christophe GONZALES(_at_AMU) *
33 * SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34 * *
35 * Contact : info_at_agrum_dot_org *
36 * homepage : http://agrum.gitlab.io *
37 * gitlab : https://gitlab.com/agrumery/agrum *
38 * *
39 ****************************************************************************/
40
41
47#ifndef GUM_SPANNING_FOREST_H
48#define GUM_SPANNING_FOREST_H
49#include <agrum/agrum.h>
50
52
53namespace gum {
54
55 /* ===========================================================================
56 */
59 /* ===========================================================================
60 */
62 public:
63 // ############################################################################
65 // ############################################################################
67
69 virtual ~SpanningForest();
70
72
73 // ############################################################################
75 // ############################################################################
77
79
80 virtual const EdgeSet& edgesInSpanningForest() = 0;
81
83
84 virtual const UndiGraph& spanningForest() = 0;
85
87
88 virtual float costOfSpanningForest() = 0;
89
91
92 protected:
93 // ############################################################################
95 // ############################################################################
97
99
102
105
107
110
112 };
113
114} /* namespace gum */
115
116#endif /* GUM_SPANNING_FOREST_H */
SpanningForest()
default constructor
virtual const UndiGraph & spanningForest()=0
Construct the spanning forest.
SpanningForest & operator=(const SpanningForest &toCopy)
Copy operator.
SpanningForest(const SpanningForest &toCopy)
Copy constructor.
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.
virtual ~SpanningForest()
Destructor.
Base class for undirected graphs.
Definition undiGraph.h:128
Set< Edge > EdgeSet
Some typdefs and define for shortcuts ...
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
Base classes for undirected graphs.