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.
SUBROUTINE DGREE(NDSTK,NR,NDEG,IOLD,IBW1,IPF1)! DGREE COMPUTES THE DEGREE OF EACH NODE IN NDSTK AND STORES! IT IN THE ARRAY NDEG. THE BANDWIDTH AND PROFILE FOR THE ORIGINAL! OR INPUT RENUMBERING OF THE GRAPH IS COMPUTED ALSO.! USE INTEGER*2 NDSTK WITH AN IBM 360 OR 370.INTEGER NDSTK! COMMON /GRA/ N, IDPTH, IDEGDIMENSION NDSTK(NR,IDEG),NDEG(N),IOLD(N)IBW1=0IPF1=0DO 40I=1,NNDEG(I)=0IRW=0DO 20J=1,IDEGITST=NDSTK(I,J)IF(ITST<=0)EXITNDEG(I)=NDEG(I)+1IDIF=IOLD(I)-IOLD(ITST)IF(IRW<IDIF)IRW=IDIF20END DOIPF1=IPF1+IRWIF(IRW>IBW1)IBW1=IRW40END DO RETURN END SUBROUTINE DGREE