spot
2.11.6
spot
mc
unionfind.hh
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2015, 2016 Laboratoire de Recherche et
3
// Developpement de l'Epita
4
//
5
// This file is part of Spot, a model checking library.
6
//
7
// Spot is free software; you can redistribute it and/or modify it
8
// under the terms of the GNU General Public License as published by
9
// the Free Software Foundation; either version 3 of the License, or
10
// (at your option) any later version.
11
//
12
// Spot is distributed in the hope that it will be useful, but WITHOUT
13
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14
// or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
15
// License for more details.
16
//
17
// You should have received a copy of the GNU General Public License
18
// along with this program. If not, see <http://www.gnu.org/licenses/>.
19
20
#pragma once
21
22
#include <spot/misc/common.hh>
23
#include <vector>
24
25
namespace
spot
26
{
27
33
class
SPOT_API
int_unionfind
final
34
{
35
private
:
36
// Store the parent relation, i.e. -1 or x < id.size()
37
std::vector<int> id;
38
39
// id of a specially managed partition of "dead" elements
40
const
int
DEAD = 0;
41
42
int
root(
int
i);
43
44
public
:
45
int_unionfind
();
46
void
makeset(
int
e);
47
bool
unite(
int
e1,
int
e2);
48
void
markdead(
int
e);
49
bool
sameset(
int
e1,
int
e2);
50
bool
isdead(
int
e);
51
};
52
}
spot::int_unionfind
This Union-Find data structure is a particular union-find, dedicated for emptiness checks below,...
Definition:
unionfind.hh:34
spot
Definition:
automata.hh:27
Please direct any
question
,
comment
, or
bug report
to the Spot mailing list at
spot@lrde.epita.fr
.
Generated on Fri Feb 27 2015 10:00:07 for spot by
1.9.1