It consists in applying heuristics to choose the best path for an edge and attributing to it a color defined automatically according to its origin and destination nodes. A grid system where certain areas are reserved for the display of nodes and others for the edges, is used for the layout of the nodes and edges. Keywords graph, incremental layout, orthogonal drawing, readability, visual language. We will therefore limit the description in this paper to aspects that have not been published yet. The reader is strongly advised to read these two earlier papers to better under- stand what is described hereafter.
Gutters contain edges and meshes contain nodes.
Gutters are each subdi- vided into nine longitudinal channels and one transversal channel. Each channel can be occupied by only one edge. Our drawing algorithm automatically finds a trajectory for every edge of the graph. Three types of edges. Partial view of the display of a graph with the initial algorithm.