Browse Prior Art Database

Method of Resetting Low Level Codes in Bills of Material

IP.com Disclosure Number: IPCOM000107336D
Original Publication Date: 1992-Feb-01
Included in the Prior Art Database: 2005-Mar-21
Document File: 3 page(s) / 77K

Publishing Venue

IBM

Related People

Hogge, WC: AUTHOR [+2]

Abstract

Disclosed is a method to efficiently reset bill of material low-level codes using a depth first search algorithm.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Method of Resetting Low Level Codes in Bills of Material

       Disclosed is a method to efficiently reset bill of
material low-level codes using a depth first search algorithm.

      In the context of material control systems, bills of material
describe the contents of each item within the system by linkages to
other items, items which may also have linkages.  An item may be
contained within several bills of material.  A bill of material can
therefore be represented by a graph.

      Low-level codes are used to quickly prevent recursion of items
within bills of material and to help other processes run more
efficiently.  This number indicates the greatest depth at which the
item can be found in any bill of material in the graph.

      The steps for this method are:
      1.   Reset all low-level codes to null.  Items with null low-
level codes are in what is termed the unvisited list [*], used to
note that the item has not been processed.
      2.   A source is an item not contained within any other item.
For each item, search for all sources within the bill of material or
nodes that have a low-level code value.  During this search, a stack
of intervening items is created.  When a source item is found, its
low-level code is marked as "00" and each item within the stack has
its low-level code incremented by one with respect to the previous
item on the stack.  These items are then entered into the visited
list (*) as the low-level code now has a value.
      3.   On returning through the stack, each item is checked for
any other sources and the process continues as described in step 2.
      4.   During the search processes, any low-level codes with
values, are visited items and further...