Browse Prior Art Database

Process for Creating Shipping List for Builds from a Directed Graph

IP.com Disclosure Number: IPCOM000111874D
Original Publication Date: 1994-Apr-01
Included in the Prior Art Database: 2005-Mar-26
Document File: 2 page(s) / 30K

Publishing Venue

IBM

Related People

Redpath, RJ: AUTHOR

Abstract

A directed graph is created for an indirect graph relationship of parts for library management of projects. The directed graph is used because it provides user keyboard traversability and is available as a standard control interface. The nodes in the graph represent parts in which the children are the dependencies for building. To perform a build on a branch, a shipping list of parts is required. A process is identified which creates a minimal list with recognition of duplication of parts from other branches with reasonable order of magnitude. The process is the following:

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

Process for Creating Shipping List for Builds from a Directed Graph

      A directed graph is created for an indirect graph relationship
of parts for library management of projects.  The directed graph is
used because it provides user keyboard traversability and is
available as a standard control interface.  The nodes in the graph
represent parts in which the children are the dependencies for
building.  To perform a build on a branch, a shipping list of parts
is required.  A process is identified which creates a minimal list
with recognition of duplication of parts from other branches with
reasonable order of magnitude.  The process is the following:

   A.o
     |
     +---A.c (23)
           |
           +--util.h (27)

   B.o
     |
     +---B.c  (45)
           |
           +--util.h (27)

A  build  is requested for nodes A.o, B.o.  The shipping list in this
case should be

o   A.c B.c util.h

      To create the shipping list, each node  stores  an  objectstore
address  for  which  the part belongs.  The file util.h under A.c and
B.c is the same file since it has the same objectstore address.  Each
node is traversed, and a list of the dependencies is created.

A.c    (23)

util.h (27)

B.c    (45)

util.h (27)

      The dependency list is sorted and the duplicates are removed by
objectstore address.   The  process  is  an  order  of  magnitude  of
N*log(N) for N nodes. ...