Detailed Description
Routine to compute the postordering of the elimination tree.
Definition in file ladel_postorder.h.
#include "ladel_types.h"
Include dependency graph for ladel_postorder.h: This graph shows which files directly or indirectly include this file:Go to the source code of this file.
Functions | |
| ladel_int | ladel_postorder (ladel_sparse_matrix *M, ladel_symbolics *sym, ladel_work *work) |
| Compute the postordering of the elimination tree. More... | |
Function Documentation
◆ ladel_postorder()
| ladel_int ladel_postorder | ( | ladel_sparse_matrix * | M, |
| ladel_symbolics * | sym, | ||
| ladel_work * | work | ||
| ) |
Compute the postordering of the elimination tree.
- Note
- The result is in sym->post.
- Parameters
-
M Sparse matrix to be analyzed sym Symbolics of the factorization (sym->post contains the output) work LADEL workspace
- Returns
- Status
Definition at line 35 of file ladel_postorder.c.
Here is the caller graph for this function: