1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
/* ========================================================================== */
/* === Include/Mongoose_EdgeCut.hpp ========================================= */
/* ========================================================================== */
/* -----------------------------------------------------------------------------
* Mongoose Graph Partitioning Library, Copyright (C) 2017-2023,
* Scott P. Kolodziej, Nuri S. Yeralan, Timothy A. Davis, William W. Hager
* Mongoose is licensed under Version 3 of the GNU General Public License.
* Mongoose is also available under other licenses; contact authors for details.
* SPDX-License-Identifier: GPL-3.0-only
* -------------------------------------------------------------------------- */
// #pragma once
#ifndef MONGOOSE_EDGECUT_HPP
#define MONGOOSE_EDGECUT_HPP
#include "Mongoose_Graph.hpp"
#include "Mongoose_EdgeCutOptions.hpp"
#include "Mongoose_EdgeCutProblem.hpp"
namespace Mongoose
{
struct EdgeCut
{
bool *partition; /** T/F denoting partition side */
Int n; /** # vertices */
/** Cut Cost Metrics *****************************************************/
double cut_cost; /** Sum of edge weights in cut set */
Int cut_size; /** Number of edges in cut set */
double w0; /** Sum of partition 0 vertex weights */
double w1; /** Sum of partition 1 vertex weights */
double imbalance; /** Degree to which the partitioning
is imbalanced, and this is
computed as (0.5 - W0/W). */
// desctructor (no constructor)
~EdgeCut();
};
EdgeCut *edge_cut(const Graph *);
EdgeCut *edge_cut(const Graph *, const EdgeCut_Options *);
EdgeCut *edge_cut(EdgeCutProblem *problem, const EdgeCut_Options *options);
} // end namespace Mongoose
#endif
|
