F. N. Paulisch and W. F. Tichy. EDGE: An Extensible Graph Editor. Software---Practice and Experience, 20(S1):63--88, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....3 extracted from EDGE #define BLACK BOX 0 #define GREY BOX 1 #define WHITE BOX 2 #define SEPARATE GRAPH 3 typedef enum black = BLACK BOX, grey = GREY BOX, white = WHITE BOX, separate = SEPARATE GRAPH statuses; Figure 8. Example of aliased enumerators found in the EDGE system [15]. A similar effect could also be achieved using a combination of #define directives and const constructs to introduce the enumerators. typedef int Starch; #define Corn 0 #define Rice 1 #define Potato 2 #define Bean 3 typedef int Grain; #define Corn 0 #define Wheat 1 #define Rye 2 ....

....results of other heuristics. Based upon these criteria, we chose the following eight systems: 1. BTOOL: A set of tools for measuring branch coverage of C programs from the University of Illinois (Brian Marick: marick testing.com) 2. EDGE: Extendible graph editor from the University of Karlsruhe [15]. 3. FIELD: Friendly Integrated Environment for Learning and Development from Brown University [18] 4. GCC: GNU C C Compiler version 2.7.1 from the Free Software Foundation. 5. GHOSTSCRIPT: PostScript interpreter version 2.6.0 from Aladdin Enterprises (PostScript is a trademark of Adobe ....

F. N. Paulisch and W. F. Tichy. EDGE: An extendible graph editor. Software--Practice and Experience, 20(S1):63--88, June 1990.

....algorithms to create a hierarchical data flow design by integrating the flat data flow design, the data dictionary, and the hierarchical clusters resulting from architecture recovery. 4. Integrate the data flow design recovered with a tool that may display the graph graphically, for instance EDGE [33]. 5. Experimentally characterize the optimality of the data flow designs resulting from the various hierarchical clustering algorithms using my goodness metric and the optimality criterion defined by [1] 6. Design a measure of computing the goodness of a data flow design that takes into account ....

F. N. Paulisch and W. F. Tichy. EDGE: An extendible graph editor. Software---Practice and Experience, 20(S1):63--88, June 1990.

....in both graphics technology and human cognitive and perceptual abilities) In practice, it is often difficult to generate effective drawings of graphs that contain just two or three hundred nodes or links. Attempts to cope with this problem have ventured in many directions: nested graphs [23, 31, 36, 58, 59, 101, 130, 134, 136], three dimensional layouts [5, 16, 19, 36, 39, 40, 55, 81, 91, 111, 112, 113, 117, 145, 146] composite graph layout [66, 77, 96] incremental layout algorithms [12, 30, 87, 100, 101, 130] information hiding [23, 37, 101, 113, 120, 121] node clustering techniques 1 [6, 13, 14, 38, 45, 49, 57, ....

....or links. Attempts to cope with this problem have ventured in many directions: nested graphs [23, 31, 36, 58, 59, 101, 130, 134, 136] three dimensional layouts [5, 16, 19, 36, 39, 40, 55, 81, 91, 111, 112, 113, 117, 145, 146] composite graph layout [66, 77, 96] incremental layout algorithms [12, 30, 87, 100, 101, 130], information hiding [23, 37, 101, 113, 120, 121] node clustering techniques 1 [6, 13, 14, 38, 45, 49, 57, 66, 74, 85, 95] and visualization of hierarchies [16, 72, 73, 82, 112, 113, 127, 138] A different solution has come in the form of a variety of overview diagrams (e.g. 56, 90, 102, ....

[Article contains additional citation context not shown here]

F. Newbery Paulisch and W.F. Tichy. EDGE: An Extensible Graph Editor. Software--Practice and Experience, 20(S1):63--88, June 1990.

....and some form of iteration. Most systems have a way to associate data or properties with either a node or an edge, although explicit support for metrics was generally absent. Most systems are also capable of specifying the visual attributes of elements and provide several choices for layout. EDGE[32] was the first object oriented graph editing toolkit to be published and seems to exemplify the design goals of many future systems, including several mentioned here: to provide a portable and extendible graph editor that can be adapted for use with many types of applications. EDGE was written in ....

Paulisch F N, Tichy W F. EDGE: an Extendible Graph Editor. Software - Practice and Experience, 1990; 20 (S1): 63-88.

....the nodes of each procedure should be grouped together, and in circuit diagrams, the elements of each module should be surrounded by rectangles indicating its borders. There are still not many layout algorithms for compound graphs. Most algorithms recursively deal with subgraphs as large nodes [4, 3] but ignore the global connectivity: Each subgraph is laid out independently which may result in too much edge crossings, if there are edges going beyond the borders of subgraphs. Other methods are restricted to planar graphs [2] We present a layout method for general directed compound graphs ....

....layers carefully afterwards such that subgraph rectangles can be drawn. Other layout methods are restricted to recursive layout where subgraphs are treated as large nodes. Edges pointing beyond the border of subgraphs are ignored during the crossing reduction. Thus they are not routed optimally [3, 4]. Such a method is used in the Edge tool [4] that allows constraint specifications by the user to influence partitioning and crossing reduction. The method of the VCG tool gived good results, is flexible and fully automatically, i.e. it does not need user constraints. It is well suited for the ....

[Article contains additional citation context not shown here]

Paulisch, F.N.; Tichy, W.F.: EDGE: An Extendible Graph Editor, Software -- Practice and Experience 20 (S1), pp. 63-88, 1990.

....and Teitelbaum [10] describes a hybrid system that combines attributed abstract syntax trees with a relational database. Our work extends their ideas by using derived relations as the source information for visualisation of software documents. General purpose graph drawing systems, such as [6, 8, 16] have been evaluated on specific software engineering diagrams from time to time, but we are not aware of any serious attempt to integrate them as generic facilities within full software engineering environments. Some generic text based systems have incorporated diagrammatic and textual views of ....

F.N. Paulisch and W.F. Tichy. Edge: an extensible graph editor. Software---Practice and Experience, S1(20):63--88, June 1990. 8

....and Teitelbaum [11] describes a hybrid system that combines attributed abstract syntax trees with a relational database. Our work extends their ideas by using derived relations as the source information for visualisation of software documents. General purpose graph drawing systems, such as [7, 9, 17, 20], have been evaluated on specific software engineering diagrams from time to time, but we are not aware of any serious attempt to integrate them as generic facilities within full software engineering environments. Some generic text based systems have incorporated diagrammatic and textual views of ....

F. Paulisch and W. Tichy. Edge: an extensible graph editor. Software---Practice and Experience, S1(20):63--88, June 1990.

....XF, and gives the user the chance to use commonly used tools inside of XF. XF uses the following external programs: ffl edge, ffl emacs, ffl shape, ffl tkemacs, ffl vi, ffl xfappdef, ffl xfhardcopy, ffl xfhelp, ffl xfpixmap, ffl xftutorial. APPENDIX A. EXTERNAL TOOLS 60 A. 1 Edge Edge[14] is a program that allows the layouting and displaying of graphs. XF uses this program as an additional feature to represent the widget structure as a tree. It is not possible to use the displayed widget tree interactively. If this feature is not used (wanted) edge is not needed. APPENDIX A. ....

F. Newbery-Paulisch and W. F. Tichy. EDGE: An Extendible Graph Editor. Software-Practice and Experience, 20, June 1990.

....some attention. Some systems employ one kind of algorithm for its domain of application; for instance, Sugiyama s algorithm [7] for drawing directed graphs has been employed in many systems [8, 9, 10] Other systems integrate many algorithms to support multi domain applications, for instance, see [11, 12, 13, 14, 15]. However, the limitations on the modelling ability of classical graphs reduces the usefulness of the drawing algorithms. Unfortunately, there is little research on automatic layout for compound graphs. The main reason is that the problem seems to be much more difficult when a hierarchy is ....

F. Newbery Paulich and W. F. Tichy. Edge: An extendible graph editor. Software -- Practice and Experience, 20(S1):63--88, 1990.

....treats fisheye view generation as a phase that precedes graph layout, rather than as a technique that alters an existing drawing, and does not suffer these drawbacks. 1 Introduction The graph topovisual formalism [6] is well suited to the task of visualizing complex relations on a set of elements [2, 13, 15, 17, 20]. Large information spaces, however, must be depicted by large graphs, thereby diminishing the effectiveness of the graph as a visualization device. To be fair, this problem is not confined to the graph: most visualization techniques do not scale very well. In particular, there is a limit to the ....

....postorder wrt Gn (A) 2. layout graph hch(v) ch(v) Theta ch(v) G(A) i 3. compute bounding box for v 4. endfor 5. layout non nested vertices Step 2 positions all vertices nested within a given vertex relative to one another. Similar layout algorithms have been described in the literature [3, 7, 10, 13, 20]. As an aside, notice that a composite layout strategy [7] can be realized simply by associating a specific layout algorithm with each vertex. 3.2 Generalized FEVs of nested graphs In this formulation, the abstract view elements are vertices, thus F G(V ) is a set of FPs. The DOI of v 2 G(V ....

[Article contains additional citation context not shown here]

F. Newbery Paulisch and W.F. Tichy. EDGE: An Extensible Graph Editor. Software--Practice and Experience, 20(S1):63-- 88, Jun. 1990.

....introduced the Hy system from a user s perspective discussing in detail one of its applications. In addition to the significance of the system as a visual database front end built around the framework described in the previous chapters, Hy can be regarded as a graph visualization system (like [NT90, KS90, BSMW90, DGGR90, HH91] or even more specifically as a software visualization system (due to the emphasis given to this application domain) The reader should bear in mind that Hy is a general system supporting the creation and filtering of hygraph visualizations. The combination of ....

F. Newbery and W. Tichy. EDGE: An extendible graph editor. Software-- Practice and Experience, 20:63--88, June 1990.

....extraction and filtering, storage and retrieval, abstraction, queries, layout, and exploration. The G system [15] is one example, although it does not attempt to solve many of the problems that we discuss later. Recent work on graph browsers and editors also addresses several of these areas [39, 25, 27, 34]. In the remainder of this section, we define the aforementioned tasks. 4.1 Graph Filtering and Extraction A (simple) graph extractor is given a database and a set of extraction criteria as input, and produces a database graph as output. Example 4.1 In the sample database, subjects, documents, ....

....to control the level of graph abstraction; however, the issues of how node groups are selected and how visibility is controlled are not addressed. 4.3. 5 Extensible Directed Graph Editor Extensible Directed Graph Editor (EDGE) is an editor kernel for the direct and visual manipulation of graphs [34]. Two techniques are proposed to create graph abstractions: multilevel subgraph abstraction and edge concentration. A multilevel subgraph abstraction is used to group a subset of the nodes and edges. It may be viewed in three ways: blackbox view (display the entire subgraph as a single, small ....

[Article contains additional citation context not shown here]

F. Newbery Paulisch and W.F. Tichy. EDGE: An Extensible Graph Editor. Software--Practice and Experience, 20(S1):63--88, June 1990.

....remain. HYPERSOLVER s graph display unit does not claim to know much about the graph layout problem. The algorithm does not work well for arbitrary graphs with no coherent node relationships. However, it works fine for the examples presented so far. Graph drawing problems are addressed in [23, 24, 25] which propose generic graph browsers or editors. Future work on HYPERSOLVER will concentrate on its applications to modeling of various phenomena in AI. This may include, for example, integrating HYPERSOLVER into a situation theoretic framework [26] where the program may solve equations whose ....

F. N. Paulisch and W. F. Tichy. EDGE: An Extensible Graph Editor. Software---Practice and Experience, 20(S1):63--88, 1990.

....This specification is then combined with the core capabilities to form an environment. This approach is very similar to the approach used in most tool generators, such as those used for parser generators [92] languagedirected editor generators [16, 64, 76] or extensible graph editors [47, 69, 79]. Customizable environments differ from frameworks in that they trade ease of instantiation for less generality. In other words, customizable environments will support a model which can be used to describe only a small portion of the entire environment. The remainder of the environment is fixed by ....

....and by generic tools. So both the environment framework as well as tools which operate over the environment are specified using this model. There is growing interest in developing structure or language based editors for manipulating graph based or graphic software specification notations. EDGE [69], TGE [49] MetaEdit [79] VSF [43, 72] and GEDL [47] are recent examples. In contrast to structured text editors and related functionality generated by GANDALF or Synthesizer Generator, these graphic meta editors provide multiple layouts of graphic information [47, 69] allow the specification ....

[Article contains additional citation context not shown here]

F. Newbury Paulisch and W. Tichy. EDGE: an extendible graph editor. Software Practice and Experience, 20(S1), June 1991.

....and, interactive graph layout [22] 2.3 Nested graphs Informally, a nested graph is an extension of a digraph in which a vertex can contain other vertices. Examples of common nested graph formalisms include: higraphs [20, 21] compound digraphs [37, 10] and the graph formalism employed by EDGE [29]. A hygraph [5] is a triple hV; A; Bi, where V is a set of vertices, A V Theta V is a set of arcs, and, B : V 2 V is a set of blobs. While arcs specify one to one (binary) relations, blobs capture one to many relations. 2.4 Graph exchange format Graph eXchange Format (GXF) 13] is a ....

F. Newbery Paulisch and W.F. Tichy. EDGE: An Extensible Graph Editor. Software--Practice and Experience, 20(S1):63--88, Jun. 1990.

....postorder wrt Gn (A) 2. layout graph hch(v) ch(v) Theta ch(v) G(A) i 3. compute bounding box for v 4. endfor 5. layout non nested vertices Step 2 positions all vertices nested within a given vertex relative to one another. Similar layout algorithms have been described in the literature [5, 12, 16, 19, 28]. As an aside, notice that a composite layout strategy [12] can be realized simply by associating a specific layout algorithm with each vertex. 4.2 Generalized FEVs of nested graphs In this formulation, the abstract view elements are vertices, thus F G(V ) is a set of FPs. The DOI of v 2 G(V ) ....

F. Newbery Paulisch and W.F. Tichy. EDGE: An Extensible Graph Editor. Software--Practice and Experience, 20(S1):63--88, Jun. 1990.

....XF, and gives the user the chance to use commonly used tools inside of XF. XF uses the following external programs: ffl edge, ffl emacs, ffl shape, ffl tkemacs, ffl vi, ffl xfappdef, ffl xfhardcopy, ffl xfhelp, ffl xfpixmap, ffl xftutorial. APPENDIX A. EXTERNAL TOOLS 37 A. 1 Edge Edge[14] is a program that allows the layouting and displaying of graphs. XF uses this program as an additional feature to represent the widget structure as a tree. It is not possible to use the displayed widget tree interactively. If this feature is not used (wanted) edge is not needed. Figure A.1: The ....

F. Newbery-Paulisch and W. F. Tichy. EDGE: An Extendible Graph Editor. Software-Practice and Experience, 20, June 1990.

No context found.

F. N. Paulisch and W. F. Tichy. EDGE: An Extensible Graph Editor. Software---Practice and Experience, 20(S1):63--88, 1990.

No context found.

F. Newbery Paulisch and W. F. Tichy. EDGE: An extendible graph editor. Software Practice and Experience, 20(S1):63--88, June 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC