Use other mechanism to determine whether an edge is already copied or not.

[libfirm] / heuristical.h

diff --git a/heuristical.h b/heuristical.h
index 5ff812d..8cc9ab6 100644 (file)
--- a/heuristical.h
+++ b/heuristical.h
@@ -3,14 +3,18 @@
 
 #include "pbqp_t.h"
 
-/**
- * Create an empty PBQP instance with the given number of nodes.
- */
-pbqp* alloc_pbqp(int number_nodes);
+void solve_pbqp_heuristical(pbqp *pbqp);
+void solve_pbqp_brute_force(pbqp *pbqp);
 
-/**
- * Free the given PBQP.
- */
-void free_pbqp(pbqp *pbqp);
+void apply_edge(pbqp *pbqp);
+
+void apply_RI(pbqp *pbqp);
+void apply_RII(pbqp *pbqp);
+void apply_RN(pbqp *pbqp);
+
+void back_propagate_RI(pbqp *pbqp, pbqp_node *node);
+void back_propagate_RII(pbqp *pbqp, pbqp_node *node);
+
+int node_is_reduced(pbqp_node *node);
 
 #endif /* KAPS_HEURISTICAL_H */