sE graph layout

[Luc4sQ]

An algorithm that computes new coordinates for nodes on their horizontal axis. Design a criterion for the placement such that the game position is clear, e.g. long near-horizontal edges are avoided. The criterion could be force-directed, e.g. chosen edges pull their connected nodes together and nodes push each other away. A possible solution is using Graphviz, possibly as a library.

main Parts:

• [x] research about existing tools/libraries or own solutions
• [x] decision to use a reseached method/library is finished
• [x] succeeded implementation of this idea in a raw format (i.E. with dot. described as under the checkboxes)
• [ ] If not done already, checked consistency in terms of doxygen and coding conventions

suggestion:

• dot: conversion of graph and output coordinates

[felbecker]

Make sure you use the new class DrawNode to access and modify the positions where each node is rendered. Please read my comment in #74.

[felbecker]

We came to the conclusion that:

• The graph layout will always be with respect to the current state (not to other selectable edges)
• The connected components of the graph are then paths
• Each path can simply be rendered vertically as a column of nodes
• This way, all connected components C with |C| > 1 are rendered horizontally one after another
• Afterwards, remaining isolated nodes are fitted into the "gaps" between the rendered columns