Jip J. Dekker
fad1b07018
git-subtree-dir: software/minizinc git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
22 lines
409 B
C++
22 lines
409 B
C++
#pragma once
|
|
|
|
#include <algorithm>
|
|
#include <vector>
|
|
|
|
namespace Algorithms {
|
|
|
|
/// An interface to some min-cut algorithm for undirected graphs
|
|
class MinCut {
|
|
public:
|
|
/// INPUT
|
|
int nNodes = 0;
|
|
std::vector<std::pair<int, int> > edges;
|
|
std::vector<double> weights;
|
|
/// OUTPUT
|
|
std::vector<bool> parities;
|
|
double wMinCut = 1e100;
|
|
/// Invocation
|
|
static void solve();
|
|
};
|
|
|
|
} // namespace Algorithms
|