Go to the source code of this file.
Functions | |
void | make_nei_ele (const int m, const int n, const int l, int **nei_ele) |
Computes neighbor cell elements array. More... | |
int | searcharr (int val, int *arr, int size) |
Search element in the given array. If element exists, return 1. More... | |
void | make_reordering (const int nele, const int nface, int **nei_ele, int *mapping, int *unmapping) |
Reverse Cuthill-McKee algorithm using neighbor elements. More... | |
void | make_coloring (const int m, const int n, const int l, int *icolor, int *lcolor) |
Coloring algorithm for unstructured grid. More... | |
void make_coloring | ( | const int | m, |
const int | n, | ||
const int | l, | ||
int * | icolor, | ||
int * | lcolor | ||
) |
Coloring algorithm for unstructured grid.
m | number of elements in x-direction |
n | number of elements in y-direction |
l | number of elements in z-direction |
icolor | Color Index of each cell |
lcolor | Color level of each cell |
Definition at line 153 of file pbutils.c.
void make_nei_ele | ( | const int | m, |
const int | n, | ||
const int | l, | ||
int ** | nei_ele | ||
) |
Computes neighbor cell elements array.
m | number of elements in x-direction |
n | number of elements in y-direction |
l | number of elements in z-direction |
nei_ele | array storing neighbor elements |
Definition at line 36 of file pbutils.c.
void make_reordering | ( | const int | nele, |
const int | nface, | ||
int ** | nei_ele, | ||
int * | mapping, | ||
int * | unmapping | ||
) |
Reverse Cuthill-McKee algorithm using neighbor elements.
nele | Number of element cells |
nface | Number of faces depends on element type |
nei_ele | Indices for neighbor cells [nface, neles] |
mapping | Reordered index by Reverse Cuthill-McKee algorithm [neles] |
unmapping | Original index before Reverse Cuthill-McKee algorithm [neles] |
Queue data structure
Last element index
Indexing variables
Definition at line 99 of file pbutils.c.