Small adjustments per compiler warnings.

Author: tturocy

src/solvers/enummixed/clique.cc

@@ -565,13 +565,12 @@ void CliqueEnumerator::workonco(int numco, Array<int> &firstedge, Array<Edge> &e
   int clique1[MAXM], clique2[MAXN];
   // CLIQUE for first and second node class
 
-  int co;
-  int countco = 0;
+  // int countco = 0;
 
-  for (co = 1; co <= numco; co++) {
+  for (int co = 1; co <= numco; co++) {
     if (firstedge[co]) {
       // found a nonzero component list
-      countco++;
+      // countco++;
       // printf("\nConnected component %d:\n", countco) ;
 
       genincidence(firstedge[co], edgelist, orignode1, orignode2, connected, &m, &n);

src/solvers/enummixed/clique.h

@@ -227,7 +227,7 @@ class CliqueEnumerator {
                 int sn1, int *sc1, int ec1,   // start NOT1, start CAND1, end CAND1
                 int sn2, int sc2, int ec2,    // start NOT2, start CAND2, end CAND2
                 int tos,                      // top of stack
-                int orignode1[], int orignode2[]);
+                int orignode1[MAXM], int orignode2[MAXN]);
   void candtry2(int stk[], // stack
                 bool connected[MAXM][MAXN],
                 int cand,                     // the candidate from NODES2  to be added to CLIQUE

src/solvers/enummixed/enummixed.cc

@@ -143,12 +143,10 @@ EnumMixedStrategySolveDetailed(const Game &p_game, StrategyCallbackType<T> p_onE
   for (size_t i = 1; i <= vert2id.size(); vert2id[i++] = 0)
     ;
 
-  int i = 0;
   int id1 = 0, id2 = 0;
 
   for (int i2 = 2; i2 <= solution->m_v2; i2++) {
     const BFS<T> &bfs1 = verts2[i2];
-    i++;
     for (int i1 = 2; i1 <= solution->m_v1; i1++) {
       const BFS<T> &bfs2 = verts1[i1];