Jip J. Dekker
f2a1c4e389
git-subtree-dir: software/mza git-subtree-split: f970a59b177c13ca3dd8aaef8cc6681d83b7e813
26 lines
454 B
C++
26 lines
454 B
C++
#ifndef __MIN_CUT_H
|
|
#define __MIN_CUT_H
|
|
|
|
#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
|
|
void solve();
|
|
};
|
|
|
|
} // namespace Algorithms
|
|
|
|
#endif // __MIN_CUT_H
|