# US 2006/0155746 A1 · Method and system for automatically hiding irrelevant parts of hierarchical structures in computer user interfaces

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2006/0155746 A1
- Document ID: US20060155746A1
- Status: Published application
- Kind: A1
- Application number: 11/034,951
- Filed: 2005-01-13
- Published: 2006-07-13
- Earliest claimed: 2005-01-13
- Assignees: International Business Machines Corporation
- Inventors: Steven Abrams; Ian Simmonds; John Vlissides
- Web page: https://patentgrep.com/patent/US20060155746A1

## CPC

- G06F 16/9027: {Trees}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The invention broadly and generally provides, in a computer-controlled display, a method of simplifying a graphical representation of a set of connected nodes comprising the steps of: (a) selecting a subset of the aforesaid set; and (b) under computer program control, hiding representations of all nodes except (i) nodes within the aforesaid subset and (ii) at least one node having a defined relationship to the aforesaid subset.

## Claims

### Claim 1

In a computer-controlled display, a method of simplifying a graphical representation of a set of connected nodes comprising the steps of:
(a) selecting a subset of said set; and
(b) under computer program control, hiding representations of all nodes except (i) nodes within said subset and (ii) at least one node having a defined relationship to said subset.

### Claim 2 (depends on 1)

A method as set forth in claim 1, wherein said graphical representation comprises a tree structure characterized by:
(a) a root node;
(b) one and only one path connecting to the root node from any other node;
(c) wherein, when two nodes occur on a single path ending at the root node, the node which is closest to the root node is an ancestor of the other node;
(d) wherein, when two nodes occur on a single path ending at the root node, the node which is furthest from the node root is a descendant of the other node; and
(e) wherein, when two descendant nodes have direct and independent paths to the same ancestor node, the two descendant nodes are siblings of each other.

### Claim 3 (depends on 2)

A method as set forth in claim 2, wherein said defined relationship is defined as:
(a) each node which is a descendant of any node within said subset has said relationship; and
(b) each node which is an ancestor of any node within said subset has said relationship.

### Claim 4 (depends on 2)

A method as set forth in claim 2, wherein said defined relationship is defined as:
(a) each node which is a descendant of any node within said subset has said relationship;
(b) each node which is an ancestor of any node within said subset has said relationship; and
(c) each node which is a sibling of any node within said subset has said relationship.

### Claim 5 (depends on 2)

A method as set forth in claim 2, wherein said defined relationship is defined as:
(a) each node which is a descendant of any node within said subset has said relationship;
(b) each node which is an ancestor of any node within said subset has said relationship;
(c) each node which is a sibling of any node within said subset has said relationship; and
(d) each node which is a sibling of an ancestor of any node within said subset has said relationship.

### Claim 6 (depends on 1)

A method as set forth in claim 1, wherein said defined relationship is defined as: each node which is directly connected to any node within said subset has said relationship.

### Claim 7 (depends on 1)

A method as set forth in claim 1, wherein said defined relationship is defined as: each node which is directly connected to any two nodes within said subset has said relationship.

### Claim 8 (depends on 1)

A method as set forth in claim 1, wherein said subset consists of nodes which are serially connected to form a single path.

### Claim 9

A system of simplifying a graphical representation of a set of connected nodes, said system comprising:
(a) a selection device operable to select a subset of said set;
(b) a hiding device operable to hide representations of all nodes except (i) nodes within said subset and (ii) at least one node having a defined relationship to said subset.

### Claim 10 (depends on 9)

A system as set forth in claim 9, wherein said graphical representation comprises a tree structure characterized by:
(a) a root node;
(b) one and only one path connecting to the root node from any other node;
(c) wherein, when two nodes occur on a single path ending at the root node, the node which is closest to the root node is an ancestor of the other node;
(d) wherein, when two nodes occur on a single path ending at the root node, the node which is furthest from the node root is a descendant of the other node; and
(e) wherein, when two descendant nodes have direct and independent paths to the same ancestor node, the two descendant nodes are siblings of each other.

### Claim 11 (depends on 10)

A system as set forth in claim 10, wherein said defined relationship is defined as:
(a) each node which is a descendant of any node within said subset has said relationship; and
(b) each node which is an ancestor of any node within said subset has said relationship.

### Claim 12 (depends on 10)

A system as set forth in claim 10, wherein said defined relationship is defined as:
(a) each node which is a descendant of any node within said subset has said relationship;
(b) each node which is an ancestor of any node within said subset has said relationship; and
(c) each node which is a sibling of any node within said subset has said relationship.

### Claim 13 (depends on 10)

A system as set forth in claim 10, wherein said defined relationship is defined as:
(a) each node which is a descendant of any node within said subset has said relationship;
(b) each node which is an ancestor of any node within said subset has said relationship;
(c) each node which is a sibling of any node within said subset has said relationship; and
(d) each node which is a sibling of an ancestor of any node within said subset has said relationship.

### Claim 14 (depends on 9)

A system as set forth in claim 9, wherein said defined relationship is defined as: each node which is directly connected to any node within said subset has said relationship.

### Claim 15 (depends on 9)

A system as set forth in claim 9, wherein said defined relationship is defined as: each node which is directly connected to any two nodes within said subset has said relationship.

### Claim 16 (depends on 9)

A system as set forth in claim 9, wherein said subset consists of nodes which are serially connected to form a single path.

### Claim 17

A program storage device readable by a digital processing apparatus and having a program of instructions which are tangibly embodied on said storage device and which are executable by said digital processing apparatus to perform a method of simplifying a graphical representation of a set of connected nodes, the method comprising:
(a) selecting a subset of said set; and
(b) hiding representations of all nodes except (i) nodes within said subset and (ii) at least one node having a defined relationship to said subset.

### Claim 18 (depends on 17)

A program storage device as set forth in claim 17, wherein said graphical representation comprises a tree structure characterized by:
(a) a root node;
(b) one and only one path connecting to the root node from any other node;
(c) wherein, when two nodes occur on a single path ending at the root node, the node which is closest to the root node is an ancestor of the other node;
(d) wherein, when two nodes occur on a single path ending at the root node, the node which is furthest from the node root is a descendant of the other node; and
(e) wherein, when two descendant nodes have direct and independent paths to the same ancestor node, the two descendant nodes are siblings of each other.

### Claim 19 (depends on 18)

A program storage device as set forth in claim 18, wherein said defined relationship is defined as:
(a) each node which is a descendant of any node within said subset has said relationship; and
(b) each node which is an ancestor of any node within said subset has said relationship.

### Claim 20 (depends on 18)

A program storage device as set forth in claim 18, wherein said defined relationship is defined as:
(a) each node which is a descendant of any node within said subset has said relationship;
(b) each node which is an ancestor of any node within said subset has said relationship; and
(c) each node which is a sibling of any node within said subset has said relationship.

### Claim 21 (depends on 18)

A program storage device as set forth in claim 18, wherein said defined relationship is defined as:
(a) each node which is a descendant of any node within said subset has said relationship;
(b) each node which is an ancestor of any node within said subset has said relationship;
(c) each node which is a sibling of any node within said subset has said relationship; and
(d) each node which is a sibling of an ancestor of any node within said subset has said relationship.

### Claim 22 (depends on 17)

A program storage device as set forth in claim 17, wherein said defined relationship is defined as: each node which is directly connected to any node within said subset has said relationship.

### Claim 23 (depends on 17)

A program storage device as set forth in claim 17, wherein said defined relationship is defined as: each node which is directly connected to any two nodes within said subset has said relationship.

### Claim 24 (depends on 17)

A program storage device as set forth in claim 17, wherein said subset consists of nodes which are serially connected to form a single path.
