mirror of
https://github.com/OPM/opm-simulators.git
synced 2024-12-20 06:23:28 -06:00
40fe2abf04
this is required for consistency amongst the compile units which are linked into the same library and seems to be forgotten quite frequently.
120 lines
2.9 KiB
C
120 lines
2.9 KiB
C
/*
|
|
Copyright 2010 SINTEF ICT, Applied Mathematics.
|
|
|
|
This file is part of the Open Porous Media project (OPM).
|
|
|
|
OPM is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
OPM is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with OPM. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
|
|
#include "config.h"
|
|
#include <assert.h>
|
|
|
|
#include <opm/core/pressure/msmfem/dfs.h>
|
|
|
|
/*
|
|
* Assign color (nonnegative number) to each connected component of graph
|
|
*/
|
|
void dfs (int size, int *ia, int *ja, int *ncolors, int *color, int* work)
|
|
{
|
|
int i, c;
|
|
enum {UNVISITED = -1, VISITED = -2};
|
|
int *stack = work;
|
|
int *count = work + size;
|
|
int *bottom = stack;
|
|
|
|
*ncolors = 0; /* colors are nonnegative */
|
|
|
|
for (i=0; i<size; ++i) {
|
|
color [i] = UNVISITED;
|
|
count [i] = ia[i+1]-ia[i];
|
|
}
|
|
|
|
/* Push seeds on stack */
|
|
for (i=0; i<size; ++i) {
|
|
if(color[i] >= 0) { /* FINISHED */
|
|
continue;
|
|
}
|
|
|
|
*stack++ = i; /* push i */
|
|
color[i] = VISITED;
|
|
|
|
while ( stack != bottom ) {
|
|
c = *(stack-1); /* peek */
|
|
|
|
if (count[c] > 0){
|
|
int child = ja[ia[c] + count[c]-1];
|
|
count[c]--;
|
|
|
|
if (color[child] == UNVISITED) {
|
|
*stack++ = child;
|
|
color[c] = VISITED;
|
|
}
|
|
|
|
} else {
|
|
color[c] = *ncolors;
|
|
--stack; /* pop c */
|
|
}
|
|
}
|
|
++*ncolors;
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
#if defined(TEST) && TEST
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
|
|
|
|
/* Test code. Reads a sparse matrix from a file specified on the */
|
|
/* command line with file format "m n\n i1 j1 v1\n i2 j2 v2\n ...". */
|
|
/* Computes reorder sequence */
|
|
int main (int argc, char *argv [])
|
|
{
|
|
int *color, *work;
|
|
int j, ncolors;
|
|
#if 0
|
|
int size = 8;
|
|
int ia[] = {0, 1, 2, 4, 5, 5, 7, 7, 8};
|
|
int ja[] = {1, 2, 0, 3, 4, 5, 6, 6};
|
|
#else
|
|
int size = 3;
|
|
int ia[] = {0,2,5,7};
|
|
int ja[] = {0,1,1,0,2,2,1};
|
|
#endif
|
|
|
|
|
|
color = malloc (size * sizeof *color);
|
|
work = malloc (2*size * sizeof *work);
|
|
dfs(size, ia, ja, &ncolors, color, work);
|
|
|
|
|
|
fprintf(stderr, "ncolors = %d\n", ncolors);
|
|
for (j=0; j<size; ++j) {
|
|
fprintf(stderr, "%d\n", color[j]);
|
|
}
|
|
|
|
|
|
free (color);
|
|
free (work);
|
|
return 0;
|
|
}
|
|
#endif
|
|
|
|
/* Local Variables: */
|
|
/* c-basic-offset:4 */
|
|
/* End: */
|