Goal is to support layout algorithms to mindap diagrams.

POC in place. Remaining tasks:

• 📖 Consider applying intersection calculation for edges, now they start and stop at the center of the nodes when using tidy-tree
• 📖 Consider updating the start position of the edge @ the source node when the edge intersect the node on the top/bottom. Then the start position should be moved so that it intersect the side of the node instead
• Proper visual tests with applicable algorithms cose-bilkens, tidy-tree, dagre and elk + (ipsec-cola?)
• Support the shapes available for Mindmaps currently only supporting rects and circles
• Handle node default width and max widths
• Add unit tests