Browse Prior Art Database

Methodology for Detecting a Disconnected Directed Transformation Graph

IP.com Disclosure Number: IPCOM000120211D
Original Publication Date: 1991-Apr-01
Included in the Prior Art Database: 2005-Apr-02
Document File: 2 page(s) / 69K

Publishing Venue

IBM

Related People

Williams, ML: AUTHOR [+2]

Abstract

This article provides a methodology of determining whether every object in a set of available transforms can be transformed into every other object within the set. This is called a disconnected directed transform graph. (A directed transformation graph which has a path between every distinct object is said to be connected, otherwise the directed transformation graph is said to be disconnected.) This article also describes a methodology for identifying potential objects for new transforms in order to connect a directed transformation graph.

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

Methodology for Detecting a Disconnected Directed Transformation Graph

      This article provides a methodology of determining
whether every object in a set of available transforms can be
transformed into every other object within the set. This is called a
disconnected directed transform graph.  (A directed transformation
graph which has a path between every distinct object is said to be
connected, otherwise the directed transformation graph is said to be
disconnected.)  This article also describes a methodology for
identifying potential objects for new transforms in order to connect
a directed transformation graph.

      In an enterprise, particularly in a multi-vendor network
environment, documents are created using many different editors.
Transforms must be provided when sending a document created by one
editor to another user using a different editor to view and/or modify
the document.  When there are a number of transforms provided in a
direct transform graph, it is difficult to manually determine if a
transform path exists between all the formats.  A methodology is
needed to quickly assess whether every object in the directed
transform graph can be transformed into every other object format.
With this knowledge, the user can decide if additional transforms are
needed in an organization.

      By taking each instance of a transform and denoting its
relationship with other objects within the system permits an adjacent
matrix to be constructed.  By converting the directed graph to an
adjacent matrix representation the following technique lets the
number of ways an obje...