Abstract: A computing system builds a graph of nodes representing design elements within a design interface having a flat structure, wherein edge weights between adjacent nodes in the graph of nodes include (1) an alignment hit count and (2) a distance measurement between the adjacent nodes. The system iteratively merges the nodes in the graph of nodes based on the edge weights, and converts, within the design interface, the flat structure into a responsive structure, with positions and sizes of the design elements unchanged, based on merging the nodes.

Abstract: A method for autolinking hierarchies is provided. The method includes receiving an initial hierarchy and a final hierarchy. The method includes determining a set of links from the initial and final hierarchies. The method includes, for each link from the set of links, identifying an unlinked child node from the initial hierarchy of a particular link. The method includes determining a match between the unlinked child node to a second unlinked child node from the final hierarchy of the particular link. The method includes generating a link between the unlinked child node to the second unlinked child node. The method includes providing a new set of links based on the generated link and the set of links. The method includes generating a transition hierarchy based on the new set of links, and the initial and final hierarchies. The method includes generating an animation based on the transition hierarchy.