Graph Layout Toolkit - Two New Libraries Available

Tom Sawyer's Graph Layout Toolkit is a family of portable libraries that
deliver an immediate face-lift to graphics applications with their
sophisticated layout algorithms. The Graph Layout Toolkit libraries'
logical representation of objects and connections allow end users to more
easily see underlying relationships within complicated data. The libraries
also work in real time, rarely requiring more than a few seconds to
produce quality output even for large graphs with several hundred nodes.

Three extensible C++ class libraries that include ANSI C APIs make up the
Graph Layout Toolkit family: the Hierarchical, Circular and Symmetric
Layout Libraries. All libraries share a common foundation.

Features

 >   Designed to support highly interactive graph editing
     applications.
 >   Flexible spacing between and around nodes.
 >   Support for variably sized nodes.
 >   Edge crossing minimization.
 >   Divide-and-conquer: layout of disconnected subgraphs.
 >   Supports "node to graph" and "edge to graph" navigation.
 >   Show hierarchy: many graphs may be drawn nested in the 
     same plane.
 >   Full support for multigraphs:
         redundant edges between pairs of nodes.
 >   Full support for reflexive edges:
         edges with the same source and target node.

The Hierarchical library is ideal for the layout of directed graphs.  For
example, it is excellent for drawing complicated function call graphs and
for layout of nested outline PERT charts used in project management
applications.

Applications for the Hierarchical layout library:
 
 >   Project management software.
 >   Compiler and software development tools.
 >   Data inspection tools.
 >   Work-flow software.
 >   Reverse engineering applications.
 >   Database schema viewers.
 >   Network management applications.

The Hierarchical library features:

 >   Hierarchical organization of nodes in a graph.
 >   Support for cyclic and acyclic directed graphs.
 >   A relatively small number of edge crossings.
 >   Graph orientation control.
 >   Node justification and alignment controls.
 >   Magnified or constant spacing controls.
 >   Performance that scales well as graph size increases.
 >   Undirected graph extensions.

The Circular library is ideal for rendering complicated ring and star
topologies. For example, this library may be used to layout complicated IP
networks where devices on the same Class A, Class B or Class C network or
devices on the same subnet are placed around the same circle. It is also
excellent at relating geographic site based information within the
framework of a logical layout product. It functions by partitioning nodes
into logical groups based on a number of flexible node grouping models.
Each group of nodes is placed on radiating circles based on the
interconnection of these groups.

Applications for the Circular layout library:

 >   Support can be easily added for network protocols such as:
     - SNA Subarea networking.
     - Appletalk networking.
     - IPX networking.

The Circular library features:

 >   Support for undirected graphs through a user-definable node
     clustering model.
 >   Detection and radiated placement of sites.
 >   Clustering models for IP networking.
 >   Administrative clustering models.
 >   Default clustering models.
 >   Flexible tailoring controls.

The Symmetric library exposes the natural symmetry inherent in many graph
structures. For instance, this library is superb at rendering arbitrary
enterprise-wide computer networks or mesh networks.

Applications for the Symmetric layout library:

 >   Computer networks.
         The Symmetric library is protocol independent.
 >   Semantic networks.
 >   Dataflow diagrams.
 >   Database schema.

The Symmetric library features:

 >   Support for directed and undirected graphs.
 >   Near-congruent drawings of isomorphic graphs.
 >   Uniform distribution of nodes.
 >   Relatively few edge crossings.
 >   Often produces planar drawings of planar graphs.

Graphs help you to manage information, but one graph is often not
sufficient. You need easy to use, yet powerful tools to help you get a
handle on the mass of graph information that often needs to be presented.

The Graph Layout Toolkit helps you write powerful graph editing
applications with intelligent window management. Set up hypertext like
associations from nodes and edges in a graph to other graphs whether they
are displayed in the same window or different windows.

Navigation features:

 >   Manage many graphs simultaneously.
 >   Supports "node to graph" navigation.
 >   Supports "edge to graph" navigation.
 >   Connection (not pointer) based navigation.
 >   Many graphs may be recursively nested in the same plane.
 >   Independent tailoring control for each graph.
 >   Fast hierarchy of graphs recalculation.
 >   Modeless drawing lists maintain pleasing graph, node and
     edge drawing orders.
 >   Save navigation information across sessions.
 >   Gives you alternatives to improve your application's use 
     of display area.

Microsoft Windows Application Development

Tom Sawyer Software's Graph Layout Toolkit - Graph Editor is a
sophisticated Microsoft Windows application development environment
designed to enable your company to quickly bring up and ship production
quality applications that draw graphs with the Graph Layout Toolkit.

The Graph Layout Toolkit - Graph Editor implements the most advanced Graph
Layout Toolkit features under Microsoft Windows. It seamlessly integrates
its facilities with Borland C++ and Object Windows.

Application developers will benefit from Tom Sawyer Software's knowledge of
the Graph Layout Toolkit framework and our significant development
experience with Microsoft Windows.

The Graph Editor features:

 >   Built-in support for all Graph Layout Toolkit styles.
 >   Dialog control for tailoring options associated with
     each layout style.
 >   Multiple Document Interface (MDI) support.
 >   Floating and locked toolbar support.
 >   Horizontal and vertical toolbar support.
 >   Object sensitive context menus.
 >   Bitmap support.
 >   Familiar mouse operations.
 >   Zooming and panning.
 >   File services.
 >   On-line help.
 >   And more...

With support for the latest Borland C++ compilers, you can build
applications that run under both Windows 3.x and Windows NT.

Supported environments

The Graph Layout Toolkit libraries run on most major operating systems and
compilers. Support is also provided for the ANSI C compiler designed to
work with these C++ compilers listed below.

 DOS: Borland C++
 OS/2 2.x: Borland C++ and and IBM C Set++
 Microsoft Windows:
    Borland C++, Microsoft Visual C++, Symantec C++, MetaWare C++
 Microsoft Windows NT:
    Borland C++, Microsoft Visual C++, Symantec C++
 Macintosh: Symantec C++, Apple MPW C++ and Think C
 Sun SPARCstation:
    SunOS 4.1.x: Sun C++ and GNU C++
    Solaris 2.x: Sun C++ and GNU C++
 HP 9000: HP C++
 SGI Iris: SGI C++
 IBM RS/6000: IBM C++
 NeXT: NeXT C++

Tom Sawyer Software
1824B Fourth St, Berkeley, CA  94710-1911
tel: 510.848.0853;  fax: 510.848.0854;  email: info@TomSawyer.com

Tom Sawyer Software Corporation

Tom Sawyer Software specializes in developing automated layout solutions
for application software. Tom Sawyer is also developing a complete line of
network management applications under the Network Layout Assistant family
name. The Network Layout Assistant for SunNet Manager 2.0 and 2.1 is
available now for $1195.

 ============================================================
 From the  'New Product Information'  Electronic News Service
 ============================================================
 This information was processed from data provided by the
 above mentioned company. For additional details, contact 
 the company at the address or telephone number indicated.
 OmniPage Pro is now used for converting all printed input! 
 ============================================================
 All submissions for this service should be addressed to:
 BAKER ENTERPRISES,  20 Ferro Dr,  Sewell, NJ  08080  U.S.A.
 Email: RBakerPC (AOL/Delphi), rbakerpc@delphi.com (Internet)
 ============================================================
