1
subroutine fpfrno(maxtr,up,left,right,info,point,merk,n1,
3
c subroutine fpfrno collects the free nodes (up field zero) of the
4
c triply linked tree the information of which is kept in the arrays
5
c up,left,right and info. the maximal length of the branches of the
6
c tree is given by n1. if no free nodes are found, the error flag
10
integer maxtr,point,merk,n1,count,ier
12
integer up(maxtr),left(maxtr),right(maxtr),info(maxtr)
14
integer i,j,k,l,n,niveau
22
20 if(j.eq.niveau) go to 30
29
30 if (i.lt.count) go to 110
30
if (i.eq.count) go to 100
32
40 if(up(count).eq.0) go to 50
37
right(count) = right(i)
39
if(merk.eq.i) merk = count
40
if(point.eq.i) point = count
47
80 if(l.eq.0) go to 90
65
if(niveau.le.n1) go to 10
66
if(count.gt.maxtr) go to 140