Microsoft Technology Licensing, LLC

Frederick Edward Weber, Iii

Kevin David James Grealish

Yin Kei

Adding new nodes to a graph diagram. A set of one or more new nodes is identified from a graph to be added to an existing graph diagram. A set of one or more anchor candidate nodes are identified in the graph that are coupled to the nodes in the set of one or more new nodes. One of the nodes in the set of one or more anchor candidate nodes is selected as an anchor node. An automatic graph diagram layout of the anchor node and new nodes that are to be coupled to the anchor node is performed to create a disjoint graph diagram. A spatial offset from the anchor node to each of the new nodes coupled to the anchor node in the disjoint graph diagram is identified. Each of the new nodes is added to the existing graph diagram while maintaining the identified spatial offsets.

Incremental automatic layout of graph diagram

Adding a new disjoint graph diagram to an existing graph diagram. A set of one or more new nodes from a graph to be added to a first graph diagram are identified. An automatic graph diagram layout of the set of one or more new nodes is performed creating a second graph diagram. The first graph diagram is aligned along a first axis with the second graph diagram Nodes in the first graph diagram that are at least partially between a first point and a second point of boundaries of the second graph diagram are identified. A boundary is created around the nodes in the first graph diagram that are between the first and second points. The second graph diagram is moved along a second axis toward the boundary to create a combined graph diagram.

Growing community of inventors

Seattle, WA, United States of America

Frederick Edward Weber, Iii