Table of contents

  1. Front Matter
  2. Pages 1-9
  3. Pages 11-14
  4. Pages 73-99
  5. Pages 101-117
  6. Pages 119-132
  7. Pages 163-165
  8. Back Matter

About this book

Introduction

Graphs can be used to convey information about relationships in many applications. State transition diagrams, PERT/CPM charts, and entity-relationship diagrams are a few examples of many applications involving graphs. Typically, nodes in the graph represent items in the application and the edges represent the relationships among these items. A graph editor is an interactive tool that presents a graph to the user pictorially and allows the user to edit the graph. This monograph presents the design of an extendible graph editor, which is a graph editor that can be adapted easily to many different application areas. Several fundamental and recurring problem areas associated with graph editors are investigated and a solution is proposed for each. The topics investigated are: - Graph layout: a layout constraint mechanism is presented which can easily be combined with various graph layout algorithms. - Graphical abstraction: a novel clustering techniquecalled edge concentration is presented which can reduce the apparent complexity of the graph. - Persistence: the graph structures produced by theeditor can be kept in long-term storage using a standardized, external format for graphs. - Extendibility: the design of the proposed graph editor makes it easy to adapt to various applications. To demonstrate their feasibility, the proposed solutions have been incorporated into EDGE, an extendible graph editor protoype.

Keywords

Algorithms Cluster Graph Layout Node algorithm complexity

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0019371
  • Copyright Information Springer-Verlag 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-57090-5
  • Online ISBN 978-3-540-47898-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book