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.
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
function get_neighbors_impl(self,i)result(neighbors)implicit none class(type_crs_adjacency_element),intent(in)::selfinteger(int32),intent(in)::iinteger(int32),allocatable::neighbors(:)integer(int32)::start_p,end_p,num_neighborsif(i<1.or.i>self%num_row)then! 範囲外の場合はサイズ0の配列を返すcall allocate_array(neighbors,length=0_int32)return end ifstart_p=self%ptr(i)end_p=self%ptr(i+1)-1num_neighbors=end_p-start_p+1if(num_neighbors>0)then call allocate_array(neighbors,length=num_neighbors)neighbors=self%ind(start_p:end_p)else call allocate_array(neighbors,length=0_int32)end if end function get_neighbors_impl