Research Article
Mathematical Modeling and Optimal Blank Generation in Glass Manufacturing
Algorithm 1
Pseudocode for Recursive Depth-First Search.
| (1) Initialize cost matrix, | | (2) Initialize number of blanks to select, | | (3) function DFS | | (4) Set as the number of columns in . | | (5) if not defined then | | (6) | | (7) | | (8) else | | (9) Set as the last element in the current path, | | (10) end if | | (11) if then | | (12) | | (13) | | (14) else | | (15) // Recursively “bubble” DFS to descendants | | (16) | | (17) Initialize () array to store cost | | (18) values of descendants | | (19) Initialize () array | | (20) to store the respective paths of descendants | | (21) for from 1 to do | | (22) | | (23) DFS | | (24) end for | | (25) // Find best path at this junction and return it | | (26) | | (27) | | (28) | | (29) return | | (30) end if | | (31) end function |
|
