ELEMENT ALLOCATION SYSTEM FOR HIERARCHICAL DIRECTED GRAPH

PURPOSE:To plot a hierarchical directed graph where the elements are arranged in clusters in an easy-to-see way by deciding not only the vertical direction of each element but the horizontal direction with decision of the hierarchical levels. CONSTITUTION:All series are extracted from a hierarchical...

Full description

Saved in:
Bibliographic Details
Main Author CHIMURA HIROYASU
Format Patent
LanguageEnglish
Published 13.07.1989
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:PURPOSE:To plot a hierarchical directed graph where the elements are arranged in clusters in an easy-to-see way by deciding not only the vertical direction of each element but the horizontal direction with decision of the hierarchical levels. CONSTITUTION:All series are extracted from a hierarchical directed graph received via a series extracting part 1 and a series weight calculation part 2 calculates the weight of all series. A main series setting part 3 sets the series of the maximum weight at the center as a main series. Then a series selecting part 4 selects the one having the largest weight out of those remaining series and a correlation calculation part 5 obtains the correlation between this selected series and the main series. An addition processing part 6 adds the selected series to the main series. Then a deciding part 7 decides the presence or absence of the series with which the addition processes are not through yet. It the presence of said series is confirmed, the operation sets back at the part 4. While if the absence of such series is confirmed, the relevant procedure is through. Thus it is possible to obtain a hierarchical directed graph where the elements are formed into clusters set in an easy-to-see arrangement.
Bibliography:Application Number: JP19880001491