Dismiss
The IQ application will be unavailable on Sunday, November 24th, starting at 9:00am ET while we make system improvements. Access will be restored as quickly as possible.
Browse Prior Art Database

Method to Traverse and Display a Rooted Directed Acyclic Graph using Preferred Parentage

IP.com Disclosure Number: IPCOM000014943D
Original Publication Date: 2001-Aug-01
Included in the Prior Art Database: 2003-Jun-20

Publishing Venue

IBM

Abstract

Method to Traverse and Display a Rooted Directed Acyclic Graph using Preferred Parentage Disclosed is a method to search and display a rooted Directed Acyclic Graph (DAG). It is achieved by superimposing a tree over the DAG. That is, each node specifies a preferred parent. This provides single path from an individual node to the root node. A DAG is defined as having: