partially fixed problems that arise in small systems by reworking the way that boundary edges are identified

1 files changed, 2 insertions, 4 deletions

diff --git a/src/analysis_tools.cpp b/src/analysis_tools.cpp
index 1e799bb..34e4ea0 100644
--- a/src/analysis_tools.cpp
+++ b/src/analysis_tools.cpp
@@ -102,12 +102,10 @@ std::list<unsigned int> find_minimal_crack(const Graph& G, const network& n) {
       std::array<unsigned int, 2> crossing_count{0,0};
 
       for (auto edge : cycle) {
-        double dx = fabs(n.G.dual_vertices[n.G.dual_edges[edge].v[0]].r.x - n.G.dual_vertices[n.G.dual_edges[edge].v[1]].r.x);
-        if (dx > n.G.L.x / 2) {
+        if (n.G.dual_edges[edge].crossings[0]) {
           crossing_count[0]++;
         }
-        double dy = fabs(n.G.dual_vertices[n.G.dual_edges[edge].v[0]].r.y - n.G.dual_vertices[n.G.dual_edges[edge].v[1]].r.y);
-        if (dy > n.G.L.y / 2) {
+        if (n.G.dual_edges[edge].crossings[1]) {
           crossing_count[1]++;
         }
       }