The current layout algorithm for the lineage graph creates massive overlaps. This problem becomes more sever with horizontal view.
It is necessary to use a better lineage algorithm, resp. changing the optimization objectives of the current layout algorithm. That is, we have to make the actions (edge labels) part of the optimization. This could potentially be done by extending the current dagre representation to include the edges. At the same time, the edge between dataObjects (nodes) should be computed the same way as before
The current layout algorithm for the lineage graph creates massive overlaps. This problem becomes more sever with horizontal view. It is necessary to use a better lineage algorithm, resp. changing the optimization objectives of the current layout algorithm. That is, we have to make the actions (edge labels) part of the optimization. This could potentially be done by extending the current dagre representation to include the edges. At the same time, the edge between dataObjects (nodes) should be computed the same way as before