1. A computer system configured to efficiently insert one or more additional nodes into a graph diagram, including calculating a boundary element for maintaining visual context of existing nodes in the graph diagram while inserting the one or more additional nodes, the system comprising: one or more processors; one or more computer-readable media having stored thereon computer-executable instructions representing at least a new graph creation tool, a layout tool, and a combiner tool, the computer-executable instructions being executable, when executed at the one or more processors, to cause the new graph creation tool to perform at least the following: convey an existing graph diagram for display on a display device; receive an updated graph, the updated graph comprising one or more nodes existing in the existing graph diagram and one or more new nodes to be added to the existing graph diagram, to update the existing graph diagram to reflect the updated graph; identify, in the updated graph, a set of one or more new nodes to be added to the existing graph diagram; and create a new graph from the set of one or more new nodes to be added to the existing graph diagram; the computer-executable instructions also being executable, when executed at the one or more processors, to cause the layout tool to automatically create a disjoint graph diagram from the new graph based at least on the new graph creation tool having created the new graph; and the computer-executable instructions also being executable, when executed at the one or more processors, to cause the combiner tool to automatically combine the disjoint graph diagram with the existing graph diagram by performing at least the following: align the existing graph diagram along a first axis with the disjoint graph diagram, such that a first boundary of the disjoint graph diagram is at a first point on the first axis, and a second boundary of the disjoint graph diagram is at a second point on the first axis; automatically identify nodes in the existing graph diagram that are at least partially between the first point and the second point; calculate a boundary element around the nodes in the existing graph diagram that are at least partially between the first point and the second point; move the disjoint graph diagram along a second axis toward the boundary element around the nodes in the first existing diagram that are at least partially between the first point and the second point to create a combined graph diagram; and convey the combined graph diagram for display at the display device.