From 4588c40a30b972f95050e87082227cd08f991293 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?B=C3=A5rd=20Skaflestad?= <Bard.Skaflestad@sintef.no>
Date: Mon, 21 May 2012 18:53:08 +0200
Subject: [PATCH] Assert that the number of strongly connected components is in
 [1 .. nc].

---
 opm/core/transport/reorder/reordersequence.cpp | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/opm/core/transport/reorder/reordersequence.cpp b/opm/core/transport/reorder/reordersequence.cpp
index 1a82a21e..29f3a0aa 100644
--- a/opm/core/transport/reorder/reordersequence.cpp
+++ b/opm/core/transport/reorder/reordersequence.cpp
@@ -11,6 +11,7 @@
 #endif
 
 #include <algorithm>
+#include <cassert>
 #include <cmath>
 #include <vector>
 
@@ -111,6 +112,9 @@ compute_reorder_sequence_graph(int           nc,
                       flux, ia, ja, work);
 
     tarjan (nc, ia, ja, sequence, components, ncomponents, work);
+
+    assert (0 < *ncomponents);
+    assert (*ncomponents <= nc);
 }