QR_MUMPS
|
This file contains the routine that computes a postorder traversal of a tree. More...
Go to the source code of this file.
Functions/Subroutines | |
subroutine | qrm_postorder (parent, n, porder, weight) |
This subroutine computes a postorder by traversing a tree in dfs. More... | |
This file contains the routine that computes a postorder traversal of a tree.
Definition in file qrm_postorder.F90.
subroutine qrm_postorder | ( | integer, dimension(:) | parent, |
integer | n, | ||
integer, dimension(:) | porder, | ||
integer, dimension(:), optional | weight | ||
) |
This subroutine computes a postorder by traversing a tree in dfs.
[in] | parent | integer array of size n. parent(i)=j means that node j is the father of node i in the tree |
[in] | n | number of nodes in the tree |
[out] | porder | an integer array of size n containing the postorder |
[in] | weight | an optional array containing nodes weights. If present, the children of each node will be sorted by increasing weight. |
Definition at line 50 of file qrm_postorder.F90.