| Méthode | Description | |
|---|---|---|
| AdjacencyMatrix ( Mesh mesh ) : System | ||
| Bandwidth ( ) : int |
Computes the bandwidth of an adjacency matrix.
|
| Méthode | Description | |
|---|---|---|
| AdjacencyCount ( Mesh mesh ) : int[] |
Counts adjacencies in a triangulation. This routine is called to count the adjacencies, so that the appropriate amount of memory can be set aside for storage when the adjacency structure is created. The triangulation is assumed to involve 3-node triangles. Two nodes are "adjacent" if they are both nodes in some triangle. Also, a node is considered to be adjacent to itself. Diagram: 3 s |\ i | \ d | \ e | \ side 1 | \ 2 | \ | \ 1-------2 side 3 |
|
| AdjacencySet ( Mesh mesh, int rows ) : int[] |
Sets adjacencies in a triangulation. This routine can be used to create the compressed column storage for a linear triangle finite element discretization of Poisson's equation in two dimensions. |
|
| CreateHeap ( int a, int offset, int size ) : void |
Reorders an array of integers into a descending heap. A heap is an array A with the property that, for every index J, A[J] >= A[2*J+1] and A[J] >= A[2*J+2], (as long as the indices 2*J+1 and 2*J+2 are legal). Diagram: A(0) / \ A(1) A(2) / \ / \ A(3) A(4) A(5) A(6) / \ / \ A(7) A(8) A(9) A(10) |
|
| HeapSort ( int a, int offset, int size ) : void |
ascending sorts an array of integers using heap sort.
|
| public AdjacencyMatrix ( Mesh mesh ) : System | ||
| mesh | Mesh | |
| Résultat | System | |