-
Notifications
You must be signed in to change notification settings - Fork 6
/
clusters.c
72 lines (67 loc) · 1.87 KB
/
clusters.c
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
/*
* Copyright (C) 2016 Zhuge Chen, Risto Vaarandi and Mauno Pihelgas
*
* This program 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 2
* 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
/*
* File: clusters.c
*
* Content: Functions related to Step3. Clusters.
*
* Created on November 30, 2016, 8:36 AM
*/
#include "common_header.h"
#include "clusters.h"
wordnumber_t step_3_find_clusters_from_candidates(struct Parameters *pParam)
{
int clusterNum;
struct Cluster *ptr, *pNext, *pPrev;
int i;
clusterNum = 0;
for (i = 1; i <= pParam->biggestConstants; i++)
{
ptr = pParam->pClusterFamily[i];
pPrev = 0;
while (ptr)
{
if (ptr->count >= pParam->support)
{
clusterNum++;
//print_cluster(ptr);
pPrev = ptr;
ptr = ptr->pNext;
}
else
{
/* Delete this cluster candidate. Only from pClusterFamily[],
but not from cluster hash table. */
if (pPrev)
{
pPrev->pNext = ptr->pNext;
}
else
{
pParam->pClusterFamily[i] = ptr->pNext;
}
pNext = ptr->pNext;
free((void *) ptr->ppWord);
free((void *) ptr->fullWildcard);
free((void *) ptr);
ptr = pNext;
}
}
}
return clusterNum;
}