Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Graph Layout System that Displays Nodes in Categories According to a User's Interactive Definition

IP.com Disclosure Number: IPCOM000113362D
Original Publication Date: 1994-Aug-01
Included in the Prior Art Database: 2005-Mar-27
Document File: 2 page(s) / 64K

Publishing Venue

IBM

Related People

Kato, A: AUTHOR

Abstract

Disclosed is a system of graph layout that displays nodes in categories according to a user's definitions (which are usually based on attributes or some other features of the nodes). This means that the system displays the categories of nodes which represent things close to each other semantically, and that a user can define the semantic closeness interactively (*).

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Graph Layout System that Displays Nodes in Categories According to
a User's Interactive Definition

      Disclosed is a system of graph layout that displays nodes in
categories according to a user's definitions (which are usually based
on attributes or some other features of the nodes).  This means that
the system displays the categories of nodes which represent things
close to each other semantically, and that a user can define the
semantic closeness interactively (*).

      The following is an example of the system.  A static analyzer
of a C++ programming environment shows graphs of static programming
structure, such as function calls, class inheritance, and class
"has-a" relationship.  Let us consider the case where a user defines
the semantic distance between two C++ classes as follows: if the name
of each of two classes contains a certain string specified by the
user (such as "Menu" or "Button" when the user is browsing a C++
class library that encapsulates GUI components), or if the name of
neither contains the string, the distance between the two classes is
0; otherwise, the distance is infinite.  (The semantic closeness, or
semantic distance, generally takes only two values, 0 and infinite.
Thus, a semantic distance divides all the nodes into two sets.) When
the class inheritance graph is displayed according to the above
distance definition, the nodes that represent classes whose names
contain the above-mentioned string, and the nodes that represent
classes whose names do not, are displayed according to their
categories.

      The above example demonstrates that the graph layout system
reflects the semantics.  As a result, the graph helps the user to
understand the semantics bet...