Use other mechanism to determine whether an edge is already copied or not.
[libfirm] / heuristical.h
1 #ifndef KAPS_HEURISTICAL_H
2 #define KAPS_HEURISTICAL_H
3
4 #include "pbqp_t.h"
5
6 void solve_pbqp_heuristical(pbqp *pbqp);
7 void solve_pbqp_brute_force(pbqp *pbqp);
8
9 void apply_edge(pbqp *pbqp);
10
11 void apply_RI(pbqp *pbqp);
12 void apply_RII(pbqp *pbqp);
13 void apply_RN(pbqp *pbqp);
14
15 void back_propagate_RI(pbqp *pbqp, pbqp_node *node);
16 void back_propagate_RII(pbqp *pbqp, pbqp_node *node);
17
18 int node_is_reduced(pbqp_node *node);
19
20 #endif /* KAPS_HEURISTICAL_H */