machinery for checking that our OUTER parallel iteration works - before we delete it

[moebius2.git] / minimise.h

diff --git a/minimise.h b/minimise.h
index 4ac64a93ab88e9b5b6a0ea37cb612562d979c14b..cf450c248781d203d6b7fc58bd63ddea4135110d 100644 (file)
--- a/minimise.h
+++ b/minimise.h
@@ -8,22 +8,35 @@
 #include "mgraph.h"
 
 double compute_energy(const struct Vertices *vs);
+void energy_init(void);
 
-double graph_layout_cost(const Vertices v);
+double graph_layout_cost(const Vertices v, int section);
 void graph_layout_prepare();
 
-void compute_vertex_areas(const Vertices vertices);
-void compute_edge_lengths(const Vertices vertices);
+void compute_vertex_areas(const Vertices vertices, int section);
+void compute_edge_lengths(const Vertices vertices, int section);
+
 extern double vertex_areas[N], vertex_mean_edge_lengths[N], edge_lengths[N][V6];
 
-double noncircular_rim_cost(const Vertices vertices);
-double edgewise_vertex_displacement_cost(const Vertices vertices);
-double edge_length_variation_cost(const Vertices vertices);
+extern const double edge_angle_cost_circcircrat;
+
+double line_bending_cost(const Vertices vertices, int section);
+double noncircular_rim_cost(const Vertices vertices, int section);
+double edge_length_variation_cost(const Vertices vertices, int section);
+double rim_proximity_cost(const Vertices vertices, int section);
+double edge_angle_cost(const Vertices vertices, int section);
+double small_triangles_cost(const Vertices vertices, int section);
+
+extern const char *input_file, *best_file;
+extern char *best_file_tmp;
+extern long long evaluations;
+extern double stop_epsilon;
+extern int quitting_last_iteration;
 
-extern const char *input_file, *output_file;
-extern char *output_file_tmp;
+#include <signal.h>
+extern sig_atomic_t quitting_reported_threads;
 
 enum printing_instance { pr_cost, pr_size, pr__max };
-int printing_check(enum printing_instance);
+int printing_check(enum printing_instance, int indent);
 
 #endif /*MINIMISE_H*/