Simplifying A Visual Depiction of A Graph

• US 20070266039A1
• Filed: 05/11/2006
• Published: 11/15/2007
• Est. Priority Date: 05/11/2006
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Giammaria, Alberto, Boykin, James, Schlosser, Brian
• Application Number:
  US11/382,755
• Publication Number:
  US 20070266039A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 8/10 Requirements analysis; Specification techniques
• CPC Class Codes: G06F 8/34 Graphical or visual programming
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling

Abstract

Methods, apparatus, and products are disclosed for simplifying a visual depiction of a graph by identifying a node for removal from the visual depiction of the graph, the node having at least two relationships with at least one remaining node, removing the node identified for removal, and creating a virtual relationship for the at least one remaining node in dependence upon the removed node'"'"'s relationships with the at least one remaining node.

Claims

1. A method for simplifying a visual depiction of a graph, the method comprising:

identifying a node for removal from the visual depiction of the graph, the node having at least two relationships with at least one remaining node;

removing the node identified for removal;

creating a virtual relationship for the at least one remaining node in dependence upon the removed node'"'"'s relationships with the at least one remaining node; and

displaying the virtual relationship.

2. The method of claim 1 wherein:

the node identified for removal is a contained node in a containment relationship with a containing node;

removing the node identified for removal further comprises collapsing the node identified for removal into the containing node; and

creating a virtual relationship for at least one of the remaining nodes in dependence upon the removed node'"'"'s relationships with the at least one remaining node further comprises creating a virtual relationship between the containing node and at least one other remaining node in dependence upon the removed node'"'"'s relationship with the at least one remaining node.

3. The method of claim 1 wherein:

the node identified for removal is a dependent node in a dependency relationship with at least one other node and the node to be removed has at least one other relationship with at least one other node;

removing the node identified for removal further comprises removing the dependent node; and

creating a virtual relationship for at least one of the remaining nodes in dependence upon the removed node'"'"'s relationships with the at least one remaining node further comprises creating a virtual relationship between at least one antecedent node of the dependency relationship and at least one other remaining node in dependence upon the removed node'"'"'s relationship with the at least one remaining node.

4. The method of claim 1 further comprising assigning a visual attribute to the virtual relationship in dependence upon the removed node'"'"'s relationship with at least one other node.

5. The method of claim 1 further comprising assigning a visual attribute to the at least one remaining node in dependence upon the removed node'"'"'s relationship with the at least one remaining node.

6. The method of claim 1 wherein identifying a node for removal from the visual depiction of the graph, the node having at least two relationships with one or more other nodes, further comprising selecting nodes for removal in dependence upon predetermined selection criteria.

7. The method of claim 1 wherein the virtual relationship is a new relationship with the at least one remaining node that retains information about the removed node'"'"'s relationships with the at least one remaining node.

8. The method of claim 1 wherein displaying the virtual relationship further comprises displaying an arrow representing the virtual relationship.

9. An apparatus for simplifying a visual depiction of a graph, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions capable of:

identifying a node for removal from the visual depiction of the graph, the node having at least two relationships with at least one remaining node;

removing the node identified for removal;

creating a virtual relationship for the at least one remaining node in dependence upon the removed node'"'"'s relationships with the at least one remaining node; and

displaying the virtual relationship.

10. The apparatus of claim 9 wherein:

the node identified for removal is a contained node in a containment relationship with a containing node;

removing the node identified for removal further comprises collapsing the node identified for removal into the containing node; and

creating a virtual relationship for at least one of the remaining nodes in dependence upon the removed node'"'"'s relationships with the at least one remaining node further comprises creating a virtual relationship between the containing node and at least one other remaining node in dependence upon the removed node'"'"'s relationship with the at least one remaining node.

11. The apparatus of claim 9 wherein:

the node identified for removal is a dependent node in a dependency relationship with at least one other node and the node to be removed has at least one other relationship with at least one other node;

removing the node identified for removal further comprises removing the dependent node; and

creating a virtual relationship for at least one of the remaining nodes in dependence upon the removed node'"'"'s relationships with the at least one remaining node further comprises creating a virtual relationship between at least one antecedent node of the dependency relationship and at least one other remaining node in dependence upon the removed node'"'"'s relationship with the at least one remaining node.

12. The apparatus of claim 9 further comprising computer program instructions capable of assigning a visual attribute to the virtual relationship in dependence upon the removed node'"'"'s relationship with at least one other node.

13. The apparatus of claim 9 wherein identifying a node for removal from the visual depiction of the graph, the node having at least two relationships with one or more other nodes, further comprising selecting nodes for removal in dependence upon predetermined selection criteria.

14. The apparatus of claim 9 wherein displaying the virtual relationship further comprises displaying an arrow representing the virtual relationship.

15. A computer program product for simplifying a visual depiction of a graph, the computer program product disposed upon a signal bearing medium, the computer program product comprising computer program instructions capable of:

identifying a node for removal from the visual depiction of the graph, the node having at least two relationships with at least one remaining node;

removing the node identified for removal;

creating a virtual relationship for the at least one remaining node in dependence upon the removed node'"'"'s relationships with the at least one remaining node; and

displaying the virtual relationship.

16. The computer program product of claim 15 wherein the signal bearing medium comprises a recordable medium.

17. The computer program product of claim 15 wherein the signal bearing medium comprises a transmission medium.

18. The computer program product of claim 15 wherein:

the node identified for removal is a contained node in a containment relationship with a containing node;

removing the node identified for removal further comprises collapsing the node identified for removal into the containing node; and

creating a virtual relationship for at least one of the remaining nodes in dependence upon the removed node'"'"'s relationships with the at least one remaining node further comprises creating a virtual relationship between the containing node and at least one other remaining node in dependence upon the removed node'"'"'s relationship with the at least one remaining node.

19. The computer program product of claim 15 wherein:

the node identified for removal is a dependent node in a dependency relationship with at least one other node and the node to be removed has at least one other relationship with at least one other node;

removing the node identified for removal further comprises removing the dependent node; and

creating a virtual relationship for at least one of the remaining nodes in dependence upon the removed node'"'"'s relationships with the at least one remaining node further comprises creating a virtual relationship between at least one antecedent node of the dependency relationship and at least one other remaining node in dependence upon the removed node'"'"'s relationship with the at least one remaining node.

20. The computer program product of claim 15 wherein identifying a node for removal from the visual depiction of the graph, the node having at least two relationships with one or more other nodes, further comprising selecting nodes for removal in dependence upon predetermined selection criteria.