implement faster outer vertex candidate queue exploiting integrality

The data structure was suggested by Lukas Miething and leads to
50% run time for larger instances!