Go to the source code of this file.
Functions/Subroutines | |
subroutine | dqrm_compute_graph (qrm_mat, graph) |
Computes the adjacency graph of a matrix. More... | |
subroutine dqrm_compute_graph | ( | type(dqrm_spmat_type) | qrm_mat, |
type(dqrm_spmat_type), intent(out) | graph | ||
) |
Computes the adjacency graph of a matrix.
This subroutine computes the column graph associated to an input matrix qrm_mat COO format. The output graph has no duplicates as well as no self-edges
[in] | qrm_mat | the input matrix |
[out] | graph | the adjacenc graph in CSC format |
Definition at line 46 of file dqrm_compute_graph.F90.
References dqrm_spmat_mod::qrm_spmat_convert::dqrm_spmat_convert(), i, qrm_error_mod::qrm_err_act_restore(), qrm_error_mod::qrm_err_act_save(), and qrm_error_mod::qrm_err_check().
Referenced by dqrm_analyse().