US Patent 11336532 Diagramming child nodes with multiple parent nodes

In an example, a method includes receiving source data that includes multiple nodes arranged in a directed acyclic graph (DAG) in which each child node of a set of child nodes has multiple incoming edges. The method includes converting the DAG to a tree in which each of the nodes has no more than one incoming edge. The method includes displaying, based on the tree, a graphical diagram with graphical objects that represent nodes of the source data, including displaying a different child graphical object for each child node of the set of child nodes in a corresponding intersection area of two corresponding container graphical objects, the corresponding intersection area representing a corresponding intersection area node in the tree.