edu.ufl.cise.amd.tdouble
Class Damd_post_tree

java.lang.Object
  edu.ufl.cise.amd.tdouble.Damd
      edu.ufl.cise.amd.tdouble.Damd_internal
          edu.ufl.cise.amd.tdouble.Damd_post_tree

public class Damd_post_tree
extends Damd_internal

Post-ordering of a supernodal elimination tree.

Field Summary

Fields inherited from class edu.ufl.cise.amd.tdouble.Damd_internal

EMPTY, FALSE, ID, Int_MAX, NDEBUG, NPRINT, TRUE

Fields inherited from class edu.ufl.cise.amd.tdouble.Damd

AMD_AGGRESSIVE, AMD_CONTROL, AMD_DATE, AMD_debug, AMD_DEFAULT_AGGRESSIVE, AMD_DEFAULT_DENSE, AMD_DENSE, AMD_DMAX, AMD_INFO, AMD_INVALID, AMD_LNZ, AMD_MAIN_VERSION, AMD_MEMORY, AMD_N, AMD_NCMPA, AMD_NDENSE, AMD_NDIV, AMD_NMULTSUBS_LDL, AMD_NMULTSUBS_LU, AMD_NZ, AMD_NZ_A_PLUS_AT, AMD_NZDIAG, AMD_OK, AMD_OK_BUT_JUMBLED, AMD_OUT_OF_MEMORY, AMD_STATUS, AMD_SUB_VERSION, AMD_SUBSUB_VERSION, AMD_SYMMETRY, AMD_VERSION

Constructor Summary

Damd_post_tree()

Method Summary

static int	amd_post_tree(int root, int k, int[] Child, int[] Sibling, int[] Order, int[] Stack)
static int	amd_post_tree(int root, int k, int[] Child, int[] Sibling, int[] Order, int[] Stack, int nn)

Methods inherited from class edu.ufl.cise.amd.tdouble.Damd_internal

AMD_DEBUG0, AMD_DEBUG1, AMD_DEBUG2, AMD_DEBUG3, AMD_DEBUG4, ASSERT, ASSERT, FLIP, IMPLIES, MAX, MAX, MIN, MIN, PRINTF, sqrt, UNFLIP

Methods inherited from class edu.ufl.cise.amd.tdouble.Damd

AMD_VERSION_CODE

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Damd_post_tree

public Damd_post_tree()

Method Detail

amd_post_tree

public static int amd_post_tree(int root,
                                int k,
                                int[] Child,
                                int[] Sibling,
                                int[] Order,
                                int[] Stack)

amd_post_tree

public static int amd_post_tree(int root,
                                int k,
                                int[] Child,
                                int[] Sibling,
                                int[] Order,
                                int[] Stack,
                                int nn)

Parameters:

root - root of the tree

k - start numbering at k

Child - input argument of size nn, undefined on output. Child [i] is the head of a link list of all nodes that are children of node i in the tree.

Sibling - input argument of size nn, not modified. If f is a node in the link list of the children of node i, then Sibling [f] is the next child of node i.

Order - output order, of size nn. Order [i] = k if node i is the kth node of the reordered tree.

Stack - workspace of size nn

nn - nodes are in the range 0..nn-1.

Returns: