/*
* abstract_dsf.h
*
* Copyright (C) 2019, Enric Meinhardt-Llopis, CMLA, ÉNS Paris-Saclay.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program.  If not, see <https://www.gnu.org/licenses/>.
*/

#ifndef _ABSTRACT_DSF_H
#define _ABSTRACT_DSF_H

// implementation of a DSF with path compression but without union by rank
void adsf_begin(int *t, int n);
int adsf_union(int *t, int n, int a, int b);
int adsf_find(int *t, int n, int a);
int adsf_number_of_classes(int *t, int n);

#endif /* _ABSTRACT_DSF_H */