Function ADS::minMaxGreedy

• Defined in File Heuristics.h

Function Documentation

inline std::vector<int> ADS::minMaxGreedy(const Adjacency &G, int a, int b)

min-max-greedy: the side of each node of G, n even, from a in \( V_0 \) and b in \( V_1 \)

Pre:

G is unoriented, i.e., square and symmetric, n even, a and b distinct nodes

Post:

two halves, a in the first and b in the second