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 are_elements_adjacent(elem1,elem2)result(is_adjacent)class(abst_element),intent(in)::elem1,elem2logical::is_adjacentinteger(int32)::i,jinteger(int32)::num_nodes1,num_nodes2integer(int32),dimension(:),pointer::ptr_conn1=>null()integer(int32),dimension(:),pointer::ptr_conn2=>null()is_adjacent=.false.num_nodes1=elem1%get_num_nodes()num_nodes2=elem2%get_num_nodes()ptr_conn1=>elem1%get_connectivity()ptr_conn2=>elem2%get_connectivity()do i=1,num_nodes1do j=1,num_nodes2if(ptr_conn1(i)==ptr_conn2(j))thenis_adjacent=.true.return end if end do end do end function are_elements_adjacent