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 get_neighbors_csr(self,node_id,neighbors)implicit none class(type_node_adjacency),intent(in)::selfinteger(int32),intent(in)::node_idinteger(int32),allocatable,intent(out)::neighbors(:)integer(int32)::start_p,end_p,degreeif(node_id<1.or.node_id>self%num_nodes)then allocate(neighbors(0));return end ifstart_p=self%ptr(node_id)end_p=self%ptr(node_id+1)-1degree=end_p-start_p+1if(degree<=0)then allocate(neighbors(0));return end if allocate(neighbors(degree))neighbors=self%ind(start_p:end_p)end subroutine get_neighbors_csr