Tree-structured diagram output method and program

• US 20030128243A1
• Filed: 08/21/2002
• Published: 07/10/2003
• Est. Priority Date: 08/22/2001
• Status: Abandoned Application

• Current Assignee: Hiroyuki Okamoto, Yasushi Nakazato, Yohichiro Miyaguchi
• Original Assignee: Hiroyuki Okamoto, Yasushi Nakazato, Yohichiro Miyaguchi
• Inventors: Nakazato, Yasushi, Okamoto, Hiroyuki, Miyaguchi, Yohichiro
• Application Number:
  US10/224,633
• Publication Number:
  US 20030128243A1
• Time in Patent Office: Days
• US Class Current: 345/853
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling

Abstract

A tree-structured diagram output method outputs a tree-structured diagram representing association of objects. In the method, an identifier which is specific to each of the objects is assigned to every object. A first object is selected from among the objects. An identifier of the selected first object is stored into a first storage portion. A second object, different from the first object, is selected from among the objects. An identifier of the selected second object is stored into a second storage portion. The identifier of the first storage portion is associated with the identifier of the second storage portion so that the association of the identifiers of the first and second objects is obtained. A tree-structured diagram representing the association of the first and second objects is outputted based on the association of the identifiers obtained in the associating step.

Claims

1. A method of outputting a tree-structured diagram representing association of objects, comprising the steps of:

assigning an identifier, which is specific to each of the objects, to every object;

selecting a first object from among the objects;

storing an identifier of the selected first object into a first storage portion;

selecting a second object, different from the first object, from among the objects;

storing an identifier of the selected second object into a second storage portion;

associating the identifier of the first storage portion with the identifier of the second storage portion so that the association of the identifiers of the first and second objects is obtained; and

outputting a tree-structured diagram representing the association of the first and second objects, based on the association of the identifiers obtained in the associating step.

2. The method of claim 1 further comprising:

setting the first object as an upper rank object; and

setting the second object as a lower rank object.

3. The method of claim 2 wherein the step of selecting the first object is provided to select only one object from among the objects as the first object, and the step of selecting the second object is provided to select two or more objects from among the objects as the second object.

4. The method of claim 1 wherein the identifier assigning step comprises:

counting the number of the objects;

storing the identifiers, which are already assigned to the respective objects by the identifier setting step, into a third storage portion; and

determining whether the number of the objects obtained in the count step matches with the number of the already assigned identifiers.

5. A computer program embodied therein for performing a tree-structured diagram output procedure to output a tree-structured diagram representing association of objects, the computer program comprising:

identifier setting program code means for assigning an identifier, which is specific to each of the objects, to every object;

first selection program code means for selecting a first object from among the objects;

first storage program code means for storing an identifier of the selected first object into a first storage portion;

second selection program code means for selecting a second object, different from the first object, from among the objects;

second storage program code means for storing an identifier of the selected second object into a second storage portion;

association program code means for associating the identifier of the first storage portion with the identifier of the second storage portion so that association of the identifiers of the first and second objects is obtained; and

output program code means for outputting a tree-structured diagram representing the association of the objects, based on the association of the identifiers.

6. The computer program of claim 5 further comprising:

first assignment program code means for assigning the first object, selected by the first selection program code means, as an upper rank object; and

second assignment program code means for assigning the second object, selected by the second selection program code means, as a lower rank object.

7. The computer program of claim 6 wherein the first selection program code means is provided to select only one object from among the objects as the first object, and the second selection program code means is provided to select two or more objects from among the objects as the second object.

8. The computer program of claim 5 wherein the identifier setting program code means comprises:

count program code means for counting the number of the objects;

third storage program code means for storing the identifiers, which are already assigned to the respective objects by the identifier setting program code means, into a third storage portion; and

determination program code means for determining whether the number of the objects matches with the number of the already assigned identifiers.

9. A method of outputting a tree-structured diagram representing association of objects, comprising the steps of:

assigning an identifier, which is specific to each of the objects, to every object;

setting an identifier of an upper rank object among the objects as an upper rank identifier;

setting identifiers of lower rank objects among the objects as lower rank identifiers;

storing association of the upper rank identifier and the lower rank identifiers into a storage portion;

classifying the lower rank objects into a plurality of groups in accordance with input operations; and

outputting a tree-structured diagram representing the association of the objects, based on the association of the upper and lower rank identifiers stored in the storage portion, such that each of the plurality of groups with respect to the lower rank objects is recognizable.

10. The method of claim 9 further comprising the steps of:

storing an input rating level for each of the lower rank objects into a rating level storage portion;

selecting a group from among the plurality of groups;

activating the rating level stored in the rating level storage portion for one of the lower rank objects included in the selected group; and

displaying the activated rating level for the selected group.

11. The method of claim 10 wherein the displaying step is provided such that, when the selected group includes two or more lower rank objects, a lowest rating level among the rating levels of the lower rank objects is displayed for the selected group.

12. The method of claim 10 wherein the displaying step is provided such that, when the selected group includes two or more lower rank objects, a rating level that is the same as the rating level of one of the two or more lower rank objects is displayed for an upper rank object associated with the two or more lower rank objects.

13. A computer program embodied therein for performing a tree-structured diagram output procedure to output a tree-structured diagram representing association of objects, the computer program comprising:

identifier setting program code means for assigning an identifier, which is specific to each of the objects, to every object;

first setting program code means for setting an identifier of an upper rank object among the objects as an upper rank identifier;

second setting program code means for setting identifiers of lower rank objects among the objects as lower rank identifiers;

storage program code means for storing association of the upper rank identifier and the lower rank identifiers into a storage portion;

grouping program code means for classifying the lower rank objects into a plurality of groups in accordance with input operations; and

output program code means for outputting a tree-structured diagram representing the association of the objects, based on the association of the upper and lower rank identifiers stored in the storage portion, such that each of the plurality of groups with respect to the lower rank objects is recognizable.

14. The computer program of claim 13 further comprising:

first program code means for storing an input rating level for each of the lower rank objects into a rating level storage portion;

second program code means for selecting a group from among the plurality of groups;

third program code means for activating the rating level stored in the rating level storage portion for one of the lower rank objects included in the selected group; and

fourth program code means for displaying the activated rating level for the selected group.

15. The computer program of claim 14 wherein the fourth program code means is provided such that, when the selected group includes two or more lower rank objects, a lowest rating level among the rating levels of the lower rank objects is displayed for the selected group.

16. The computer program of claim 14 wherein the fourth program code means is provided such that, when the selected group includes two or more lower rank objects, a rating level that is the same as the rating level of one of the two or more lower rank objects is displayed for an upper rank object associated with the two or more lower rank objects.