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.
INTEGER FUNCTION SORT2()! SORT2 SORTS SIZEG AND STPT INTO DESCENDING ORDER ACCORDING TO! VALUES OF SIZEG. XCC=NUMBER OF ENTRIES IN EACH ARRAYINTEGER TEMP! IT IS ASSUMED THAT THE GRAPH HAS AT MOST 50 CONNECTED COMPONENTS.!COMMON /CC/ XCC, SIZEG(50), STPT(50)SORT2=0IF(XCC==0)RETURNSORT2=1IND=XCC10ITEST=0IND=IND-1IF(IND<1)RETURN DO 20I=1,INDJ=I+1IF(SIZEG(I)>=SIZEG(J))CYCLEITEST=1TEMP=SIZEG(I)SIZEG(I)=SIZEG(J)SIZEG(J)=TEMPTEMP=STPT(I)STPT(I)=STPT(J)STPT(J)=TEMP20END DO IF(ITEST==1)GOTO10RETURN END FUNCTION SORT2