Large refactoring around changes in the graph class.

  - Graphs now use lists of references instead of vectors of indicies.
  - Vertices and edges have associated classes that can be given arbitrary properties via template specification.
  - All essential library headers have been combined into one, wolff.hpp.

1 files changed, 54 insertions, 0 deletions

diff --git a/lib/wolff_models/dihedral.hpp b/lib/wolff_models/dihedral.hpp
new file mode 100644
index 0000000..aef3be6
--- /dev/null
+++ b/lib/wolff_models/dihedral.hpp
@@ -0,0 +1,54 @@
+
+#ifndef WOLFF_MODELS_DIHEDRAL_H
+#define WOLFF_MODELS_DIHEDRAL_H
+
+#include "potts.hpp"
+
+namespace wolff {
+
+  template <unsigned q>
+  class dihedral_t {
+    public:
+      bool is_reflection;
+      unsigned x;
+
+      dihedral_t() : is_reflection(false), x(0) {}
+      dihedral_t(bool x, unsigned y) : is_reflection(x), x(y) {}
+
+      potts_t<q> act(const potts_t<q>& s) const {
+        if (this->is_reflection) {
+          return potts_t<q>(((q + this->x) - s.x) % q);
+        } else {
+          return potts_t<q>((this->x + s.x) % q);
+        }
+      }
+
+      dihedral_t<q> act(dihedral_t<q> r) const {
+        if (this->is_reflection) {
+          return dihedral_t<q>(!(r.is_reflection), ((q + this->x) - r.x) % q); 
+        } else {
+          return dihedral_t<q>(r.is_reflection, (this->x + r.x) % q);
+        }
+      }
+
+      potts_t<q> act_inverse(potts_t<q> s) const {
+        if (this->is_reflection) {
+          return this->act(s);
+        } else {
+          return potts_t<q>(((s.x + q) - this->x) % q);
+        }
+      }
+
+      dihedral_t<q> act_inverse(dihedral_t<q> r) const {
+        if (this->is_reflection) {
+          return this->act(r);
+        } else {
+          return dihedral_t<q>(r.is_reflection, ((r.x + q) - this->x) % q);
+        }
+      }
+  };
+
+}
+
+#endif
+