GD2001: Graph Drawing Contest

Graph B


Graph B is a finite state diagram from an industrial application. It is a small graph with 18 nodes and 37 arcs. Two nodes have self-loops and some nodes have by-parallel arcs in each direction. The nodes and arcs are labelled.


The primary goal is a meaningful display of the diagram. The drawing should be made by an algorithm - at least partially. I have a reasonable hand made drawing. Entries should explain the design process and the steps where drawing algorithms have been used.
(See Ulrik Brandes, "Hunting Down Graph B, GD'99, LNCS 1731, pp. 410-415, 1999)


Graph B in GML-format with random coordinates.