Legacy Project

KEG is not maintained anymore and hence not part of any release. To test= layout algorithms, we now use the KGraph Text Editor with KLighD.

=20

Responsible:

Related Theses:

- Martin Rie=C3=9F,
*A Graph Editor for Algorithm Engineering*, Se= ptember 2010 (pdf)<= /li>

The KIELER Editor for Graphs (KEG) is an Eclipse-based graph editor desi= gned for the development of graph algorithms, especially layout algorithms.= To fit this purpose the KEG is able to represent most of the structures wh= ich are of interest in graph theory and supplies tools to construct and ver= ify graph instances:

- Nodes
- Directed and undirected edges
- Hyperedges, using a combination of hypernodes and common directed or un= directed edges
- Ports
- Compound nodes
- Node and edge labels

To start using the editor create a new *KEG Diagram* wi=
th the appropriate wizard. This will automatically open a new diagram edito=
r and create the two required files: the *.keg file containing th=
e KEG model and the *.kegdi file containing the GMF notation mode=
l, that is a GMF specific model to hold information about the layout of the=
diagram and the linkage of diagram elements to model elements.

Create an empty graph

File =E2=86=92 New =E2=86=92 Other... =E2=86= =92 KIELER =E2=86=92 KEG Diagram

An alternative to starting with an empty diagram is the random graph wiz= ard, which allows the user to generate a KEG graph utilizing one of several= configurable creation algorithms. The used algorithm determines the genera= l structure of the generated graph:

*Any Graph*- can create any kind of graph, customizations = can restrict the randomness by disallowing self-loops, multi-edges and cycl= es*Tree*- creates a rooted tree with specified maximum degre= e and width*Biconnected Graph*- creates a biconnected graph*Triconnected Graph*- creates a triconnected graph*Acyclic graph without transitive edges*- creates an acycl= ic graph without transitive edges, can be customized to force planarity

For all selected algorithms the number of nodes in the generated graph h= as to be specified, and in most cases the number of edges can be specified = directly. The implemented graph creation algorithms are based upon the= implementations found in the OGDF library.

Create a random graph

File =E2=86=92 New =E2=86=92 Other... =E2=86=92 KIELER= =E2=86=92 Random KEG Graph

There are many use-cases in which it is not required or desired to const= ruct a graph by hand or generating a random graph, because a preexisting gr= aph library fulfills all required criteria. In this cases importing those g= raph files is the best solution. The graph import wizard provided by KEG ca= n import from the following graph formats:

Note that in some cases the interpretation of values in those models is = not clearly specified and can differ in other implementations.

Import an existing graph

File =E2=86=92 Import... =E2=86=92 KIELER =E2=86=92 Gr= aphs to KEG Graphs

Graphs created with KEG can be exported to different formats (a list is = shown on the generated layout web serv= ice page).

Export a KEG graph

File =E2=86=92 Export... =E2=86=92 KIELER =E2=86=92 Ex= port Graph

The layout algorithms provided by the Layout project can be applied to KEG diagra= ms using the = KIML user interface. The KEG editor is a good choice for testing these = algorithms.

Invoke automatic layout

Hit first Ctrl + R, then L (on MacOS: Cmd + R, then L)

KIML provides various graph analysis algorithms for obtaining informatio= n on the structure and the drawing of a graph. This can also be applied in = batch mode in order to analyze a large number of graphs.