order_find_supernodes.c File Reference

#include "common.h"
#include "graph/graph.h"
#include "order/order_internal.h"

Go to the source code of this file.

Functions
static void	compute_subtree_size (pastix_int_t n, const pastix_int_t *father, const pastix_int_t *iperm, pastix_int_t *T)
	Computes the size of each subtree.
static void	compute_post_order (pastix_int_t n, const pastix_int_t *father, pastix_int_t *perm, pastix_int_t *invp, pastix_int_t *T)
	Computes the post order of the elimination tree given on entry.
static void	compute_elimination_tree (pastix_int_t n, const pastix_int_t *ia, const pastix_int_t *ja, const pastix_int_t *perm, const pastix_int_t *invp, pastix_int_t *father)
	Compute the elimination tree of a matrix A (without computing the symbolic factorization) associated with a reordering of the matrix.
void	orderFindSupernodes (const pastix_graph_t *graph, pastix_order_t *const ordeptr)
	Computes the set of supernodes for a given permutation.

Detailed Description

PaStiX order function to find supernodes out of a given permutation.

Copyright

2004-2025 Bordeaux INP, CNRS (LaBRI UMR 5800), Inria, Univ. Bordeaux. All rights reserved.

Version

6.4.0

Author

Pascal Henon

Mathieu Faverge

Pierre Ramet

Tony Delarue

Date

2024-07-05

Definition in file order_find_supernodes.c.