#pragma once
#include "rng.hpp"
#include "solution.hpp"

// Leaf edge-split local search (first improvement, random leaf order).
// For each degree-1 node, tries detaching it and inserting it in the
// middle of another solution edge, splitting that edge in two.
// Returns true if any improvement was made.
bool vnd4(Solution& sol, int d, RNG& rng);
bool vnd4bi(Solution& sol, int d, RNG& rng);