LIBINT 2.7.2
strategy.h
1/*
2 * Copyright (C) 2004-2021 Edward F. Valeev
3 *
4 * This file is part of Libint.
5 *
6 * Libint is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version.
10 *
11 * Libint is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with Libint. If not, see <http://www.gnu.org/licenses/>.
18 *
19 */
20
21#include <smart_ptr.h>
22#include <tactic.h>
23#include <global_macros.h>
24#include <graph_registry.h>
25
26#ifndef _libint2_src_bin_libint_strategy_h_
27#define _libint2_src_bin_libint_strategy_h_
28
29#define USE_HRR_FOR_TiG12 1
30
31namespace libint2 {
32
33 class DGVertex;
34 class DirectedGraph;
35
39 class Strategy {
40
41 public:
42 typedef SafePtr<RecurrenceRelation> RR;
43 Strategy() {}
44 ~Strategy() {}
45
47 RR optimal_rr(const SafePtr<DirectedGraph>& graph,
48 const SafePtr<DGVertex>& integral,
49 const SafePtr<Tactic>& tactic);
50 };
51
52};
53
54#endif
Strategy specifies how to apply recurrence relations.
Definition: strategy.h:39
RR optimal_rr(const SafePtr< DirectedGraph > &graph, const SafePtr< DGVertex > &integral, const SafePtr< Tactic > &tactic)
Returns the optimal recurrence relation for integral.
Defaults definitions for various parameters assumed by Libint.
Definition: algebra.cc:24