1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
/*
//
// Copyright 1997-2010 Torsten Rohlfing
//
// This file is part of the Computational Morphometry Toolkit.
//
// http://www.nitrc.org/projects/cmtk/
//
// The Computational Morphometry Toolkit is free software: you can
// redistribute it and/or modify it under the terms of the GNU General Public
// License as published by the Free Software Foundation, either version 3 of
// the License, or (at your option) any later version.
//
// The Computational Morphometry Toolkit 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with the Computational Morphometry Toolkit. If not, see
// <http://www.gnu.org/licenses/>.
//
// $Revision: 5436 $
//
// $LastChangedDate: 2018-12-10 19:01:20 -0800 (Mon, 10 Dec 2018) $
//
// $LastChangedBy: torstenrohlfing $
//
*/
#ifndef __cmtkUnionFind_h_included_
#define __cmtkUnionFind_h_included_
#include <cmtkconfig.h>
#include <set>
#include <list>
namespace
cmtk
{
/** \addtogroup Base */
//@{
/// Class template for (relatively) efficient union-find algorithm.
template<class T>
class UnionFind
{
public:
/// Internal set type.
typedef std::set<T> SetType;
/// Internal list type.
typedef std::list<SetType> ListType;
/// Opqaue result of "find" operation.
typedef typename ListType::iterator FindResultType;
/// Find operation.
FindResultType Find( const T& key )
{
for ( FindResultType it = this->m_List.begin(); it != this->m_List.end(); ++it )
{
if ( it->find( key ) != it->end() )
return it;
}
return this->End();
}
/// Find representative key.
const T FindKey( const T& key )
{
return *(this->Find( key )->begin());
}
/// End-of-list iterator.
FindResultType End()
{
return this->m_List.end();
}
/// Union operation.
void Union( const FindResultType& s1, const FindResultType& s2 )
{
if ( s1 != s2 )
{
s1->insert( s2->begin(), s2->end() );
this->m_List.erase( s2 );
}
}
/// Insert a new key by itself.
void Insert( const T& key )
{
SetType newSet;
newSet.insert( key );
this->m_List.push_back( newSet );
}
private:
/// The list of sets.
ListType m_List;
};
//@}
} // namespace cmtk
#endif // #ifndef __cmtkUnionFind_h_included_
|
