/
AllEquivalentCyclicSet.java
108 lines (95 loc) · 3.93 KB
/
AllEquivalentCyclicSet.java
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
/*
* Copyright (c) 2013. John May <jwmay@users.sf.net>
*
* Contact: cdk-devel@lists.sourceforge.net
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation; either version 2.1
* of the License, or (at your option) any later version.
* All we ask is that proper credit is given for our work, which includes
* - but is not limited to - adding the above copyright notice to the beginning
* of your source code files, and to any copyright notice that you may distribute
* with programs based on this work.
*
* 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 U
*/
package org.openscience.cdk.hash.equivalent;
import org.openscience.cdk.annotations.TestClass;
import org.openscience.cdk.annotations.TestMethod;
import org.openscience.cdk.interfaces.IAtomContainer;
import org.openscience.cdk.ringsearch.RingSearch;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;
/**
* Finds the set of equivalent values are members of a ring. This class is
* intended to drive the systematic perturbation of the {@link
* org.openscience.cdk.hash.PerturbedAtomHashGenerator}. This {@link
* EquivalentSetFinder} provides the highest probability of avoid collisions due
* to uniform atom environments but is much more demanding then the simpler
* {@link MinimumEquivalentCyclicSet}.
*
* <p/><br/> The easiest way to use this class is with the {@link
* org.openscience.cdk.hash.HashGeneratorMaker}.
* <blockquote><pre>
* MoleculeHashGenerator generator =
* new HashGeneratorMaker().depth(6)
* .elemental()
* .perturbWith(new AllEquivalentCyclicSet())
* .molecular();
* </pre></blockquote>
*
* @author John May
* @cdk.module hash
* @see org.openscience.cdk.hash.PerturbedAtomHashGenerator
* @see MinimumEquivalentCyclicSet
* @see MinimumEquivalentCyclicSetUnion
*/
@TestClass("org.openscience.cdk.hash.equivalent.AllEquivalentCyclicSetTest")
public final class AllEquivalentCyclicSet implements EquivalentSetFinder {
/**
* @inheritDoc
*/
@Override
@TestMethod("testFind,testFind_Distinct,testScenario")
public Set<Integer> find(long[] invariants, IAtomContainer container, int[][] graph) {
int n = invariants.length;
// find cyclic vertices using DFS
RingSearch ringSearch = new RingSearch(container, graph);
// ordered map of the set of vertices for each value
Map<Long, Set<Integer>> equivalent = new TreeMap<Long, Set<Integer>>();
// divide the invariants into equivalent indexed and ordered sets
for (int i = 0; i < invariants.length; i++) {
Long invariant = invariants[i];
Set<Integer> set = equivalent.get(invariant);
if (set == null) {
if (ringSearch.cyclic(i)) {
set = new HashSet<Integer>(n / 2);
set.add(i);
equivalent.put(invariant, set);
}
} else {
set.add(i);
}
}
// find the smallest set of equivalent cyclic vertices
Set<Integer> set = new TreeSet<Integer>();
for (Map.Entry<Long, Set<Integer>> e : equivalent.entrySet()) {
Set<Integer> vertices = e.getValue();
if (vertices.size() > 1) {
set.addAll(vertices);
}
}
return set;
}
}