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, 0 insertions, 59 deletions

diff --git a/lib/include/wolff/models/symmetric.hpp b/lib/include/wolff/models/symmetric.hpp
deleted file mode 100644
index d15a7ba..0000000
--- a/lib/include/wolff/models/symmetric.hpp
+++ /dev/null
@@ -1,59 +0,0 @@
-
-#ifndef WOLFF_MODELS_SYMMETRIC_H
-#define WOLFF_MODELS_SYMMETRIC_H
-
-#include <array>
-
-#include "potts.hpp"
-
-namespace wolff {
-
-#include "../types.h"
-
-template <q_t q>
-class symmetric_t : public std::array<q_t, q> {
-  public:
-
-    symmetric_t() {
-      for (q_t i = 0; i < q; i++) {
-        (*this)[i] = i;
-      }
-    }
-
-    potts_t<q> act(const potts_t<q> &s) const {
-      return potts_t<q>((*this)[s.x]);
-    }
-
-    symmetric_t<q> act(const symmetric_t<q>& r) const {
-      symmetric_t<q> r_rot;
-      for (q_t i = 0; i < q; i++) {
-        r_rot[i] = (*this)[r[i]];
-      }
-
-      return r_rot;
-    }
-
-    potts_t<q> act_inverse(const potts_t<q>& s) const {
-      for (q_t i = 0; i < q; i++) {
-        if ((*this)[i] == s.x) {
-          return potts_t<q>(i);
-        }
-      }
-
-      exit(EXIT_FAILURE);
-    }
-
-    symmetric_t<q> act_inverse(const symmetric_t<q>& r) const {
-      symmetric_t<q> r_rot;
-      for (q_t i = 0; i < q; i++) {
-        r_rot[(*this)[i]] = r[i];
-      }
-
-      return r_rot;
-    }
-};
-
-}
-
-#endif
-