permlib  0.2.9
Library for permutation computations
intersection_search.h
1 // ---------------------------------------------------------------------------
2 //
3 // This file is part of PermLib.
4 //
5 // Copyright (c) 2009-2011 Thomas Rehn <thomas@carmen76.de>
6 // All rights reserved.
7 //
8 // Redistribution and use in source and binary forms, with or without
9 // modification, are permitted provided that the following conditions
10 // are met:
11 // 1. Redistributions of source code must retain the above copyright
12 // notice, this list of conditions and the following disclaimer.
13 // 2. Redistributions in binary form must reproduce the above copyright
14 // notice, this list of conditions and the following disclaimer in the
15 // documentation and/or other materials provided with the distribution.
16 // 3. The name of the author may not be used to endorse or promote products
17 // derived from this software without specific prior written permission.
18 //
19 // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 //
30 // ---------------------------------------------------------------------------
31 
32 
33 #ifndef CLASSIC_INTERSECTION_SEARCH_H_
34 #define CLASSIC_INTERSECTION_SEARCH_H_
35 
36 #include <permlib/search/classic/backtrack_search.h>
37 #include <permlib/predicate/group_intersection_predicate.h>
38 
39 namespace permlib {
40 namespace classic {
41 
43 template<class BSGSIN,class TRANSRET>
44 class IntersectionSearch : public BacktrackSearch<BSGSIN,TRANSRET> {
45 public:
46  typedef typename BacktrackSearch<BSGSIN,TRANSRET>::PERM PERM;
47  typedef typename BacktrackSearch<BSGSIN,TRANSRET>::TRANS TRANS;
48 
50 
54  IntersectionSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM);
55 
57 
60  void construct(BSGSIN* bsgs2);
61 };
62 
63 template<class BSGSIN,class TRANSRET>
64 IntersectionSearch<BSGSIN,TRANSRET>::IntersectionSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM)
65  : BacktrackSearch<BSGSIN,TRANSRET>(bsgs, pruningLevelDCM)
66 { }
67 
68 template<class BSGSIN,class TRANSRET>
72 
73  BacktrackSearch<BSGSIN,TRANSRET>::construct(intersectPred, false);
74 }
75 
76 }
77 }
78 
79 #endif // -- CLASSIC_INTERSECTION_SEARCH_H_
void construct(BSGSIN *bsgs2)
initializes search
Definition: intersection_search.h:69
searching in a group with classical backtracking
Definition: backtrack_search.h:50
predicate for the subgroup that arises as the intersection of two given groups
Definition: group_intersection_predicate.h:45
subgroup search for a group intersection based on classical backtracking
Definition: intersection_search.h:44
IntersectionSearch(const BSGSIN &bsgs, unsigned int pruningLevelDCM)
constructor
Definition: intersection_search.h:64
void construct(SubgroupPredicate< PERM > *pred, bool addPredRefinement)
initializes the search
Definition: backtrack_search.h:188
Definition: abstract_bsgs.h:49