Topic 1: Restricted Area

In all categories, nodes must be placed on grid points. The area of grids is restricted. Layouts that exceed that area are not permitted. Edges must be routed within the restricted area, but there is no restriction concerning the shape of edges. Edge crossings are allowed.

The graphs are evaluated according to aesthetic appearance and how well the area is used. Submissions that exceed the given area or where nodes are not placed on grid points are not accepted.

Category A

This graph is a simple directed tree. The allowed area is 30 x 30 grid points.
The data can be obtained here.

Category B

This graph is a directed, planar DAG. In fact, it is a series-parallel graph. The allowed area is 22 x 30 grid points.
The data can be obtained here.

Category C

This graph is undirected and disconnected. The allowed area is 22 x 22 grid points.
The data can be obtained here.

File Format

The graphs are given in a simple Ascii file format.

• The first number (N) indicates the number of nodes in the graph.
  Nodes have indices 0,...,N-1.
• The remainder of the file contains the edges. For each edge, the first value is the index of the source node, and the second value is the index of the target node.
• Lines starting with a # are comments and shall be ignored.

Sample file. Below is a simple example with 5 nodes and 8 edges.

 # Lines starting with # are comments and ignored 
 # First value is NumNodes(N)
 5
 #
 # Remaining lines are the edges.
 # The first value is the source node.
 # The second value is the target node.
 1 0
 0 3
 2 1
 2 3
 0 2
 1 4
 4 3
 0 4