5 * Revision 1.1.1.1 1996/04/01 15:02:57 mclareni
10 SUBROUTINE PGRAPH(WEIT, EDGES, NODES, SET, SETPTR, NPTR)
11 INTEGER EDGES, TABNR, ONETWO, TWOONE, SETPTR
21 COMMON /BITSXB/ NBITPW, NBYTPW
22 IF(NPTR.GT.0) GO TO CHOICE,(10,20)
36 IF(IGET(WEIT(1,1), K) .EQ. L) NODEFQ = NODEFQ + 1
37 IF(IGET(WEIT(1,2), K) .EQ. L) NODEFQ = NODEFQ + 1
39 IF(MAX .GE. NODEFQ) GO TO 60
55 IF(IGET(WEIT(1,ONETWO), I) .NE. NODE) GO TO 3
58 WSET(LWSET) = IGET(WEIT(1,TWOONE), I)
62 IND = LTEIT(TABNR) + 1 + K1
63 CALL TUP(TEIT(1,1), IND, IGET(WEIT(1,1), I))
64 CALL TUP(TEIT(1,2), IND, IGET(WEIT(1,2), I))
67 IF(K1 .EQ. 0) GO TO 300
68 IND = LSETT(TABNR) + 1
70 CALL TUP(SETT, IND, VSET(I))
76 LSETT(TABNR) = LSETT(TABNR - 1) + LVSET
77 LTEIT(TABNR) = LTEIT(TABNR - 1) + K1
79 IANF = LTEIT(TABNR - 1) + 1
85 IF(IGET(TEIT(1,ONETWO), I) .EQ. WSET(L)) GO TO 200
89 CALL TUP(WEIT(1,1), K1, IGET(TEIT(1,1), I))
90 CALL TUP(WEIT(1,2), K1, IGET(TEIT(1,2), I))
92 IF(K1 .EQ. 0) GO TO 10
99 C THE STATEMENTS 300 ... 20 RETURN THE SOLUTIONS IN V AND W.
100 C BEFORE RETURNING, HOWEVER, THE 'COMPLEMENT' OF THE SOLUTION IS
101 C COMPUTED (= ALL NODES OF THE GRAPH NOT CONTAINED IN THE SOLUTION)
102 C AND STORED INTO 'SET', FOLLOWED BY THE ACTUAL(CONFER ALGORITHM OF
103 C S.R. DAS) SOLUTION.
106 CALL TREVNI(VSET, LVSET, SET, NODES, SETPTR)
110 41 SET(NPTR) = VSET(I)
114 CALL TREVNI(WSET, LWSET, SET, NODES, SETPTR)
118 40 SET(NPTR) = WSET(I)
125 IF(TABNR .EQ. 1) GO TO 999
126 LWEIT = LTEIT(TABNR) - LTEIT(TABNR - 1)
127 LWSET = LSETT(TABNR) - LSETT(TABNR - 1)
130 IND = LTEIT(TABNR) + 1
132 CALL TUP(WEIT(1,1), I, IGET(TEIT(1,1), IND))
133 CALL TUP(WEIT(1,2), I, IGET(TEIT(1,2), IND))
135 IND = LSETT(TABNR) + 1