Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.
Source Code
subroutine initialize_type_reordering(self,algorithm_name,node_adj)implicit none class(type_reordering),intent(inout)::selfcharacter(*),intent(in)::algorithm_nameclass(type_node_adjacency),intent(in)::node_adjif(allocated(self%algorithm_name))deallocate(self%algorithm_name)allocate(character(len=len_trim(algorithm_name))::self%algorithm_name)self%algorithm_name=trim(adjustl(algorithm_name))select case(self%algorithm_name)case("rcm")call self%rcm_reorder_method(node_adj)call self%create_inverse_permutation()case("cm")call self%cm_reorder_method(node_adj)call self%create_inverse_permutation()case default! No reorderingend select end subroutine initialize_type_reordering