METHOD FOR PARTIAL UPDATING
Methods are for partial updating a graph's layout for nodes and their respective connections when a change to the graph occurs, each node being linked with another node by a connecting line and the connecting line being attached to the respective nodes by using a port on the node. A method of an embodiment includes receiving a user input of an update of the layout. The update includes adding a node or a connecting line, moving a node or a connecting line, or resiting a node. The method of an embodiment further includes positioning the port only on the node affected by the update and on the node connected with the affected one. The method of an embodiment further includes routing the connecting line between the affected node and the node connected.
1 . A method for partial updating of a layout of a graph for a plurality of nodes, and respective connections between the plurality of nodes, upon a change to the graph occurring, each node of the plurality of nodes being linked with another node of the plurality of nodes by a respective connecting line, the respective connecting line being attached to respective linked nodes by using a port on a respective one of the linked nodes, the method, performed by a data processing system, comprising:
receiving a user input of an update of the layout, the update including adding a node or a connecting line, moving a node or a connecting line, or resizing a node;
positioning the port only on a node affected by the update received and on a node connected with the node affected by the update received one; and
routing the connecting line, between the node affected by the update received and the node connected, based on the position of the port updated by the positioning.
2 . The method of claim 1 , wherein keeping an existing position of the port unchanged, on the node affected or on the node connected with the node affected, unless the node affected or the node connected is shrunk with at least one port outside of a boundary of the node affected or the node connected.
3 . The method of claim 1 , wherein the connecting line is routed with priority of 1-segment routing, 3-segment routing and 5-segment routing.
4 . The method of claim 3 , wherein the 1-segment routing comprises connecting two ports with one straight line, without the one straight line overlapping any node of the plurality of nodes.
5 . The method of claim 3 , wherein the 3-segment routing comprises connecting two ports by three straights lines., without any of the three straight lines overlapping any node of the plurality of nodes, one line being vertically connected with another two lines extending from the two ports.
6 . The method of claim 3 , wherein the 5-segment routing comprises connecting two ports by fine straights lines without any of the fine straights Hines overlapping any node of the plurality of nodes, wherein, one line is vertically connected with two lines, each of the two lines being vertically connected with a line extending from one port.
7 . A data processing system comprising:
a processor; and
an accessible memory, the processor configured to partial update a layout of a graph for a plurality of nodes and respective connections between nodes of the plurality of nodes, upon a change to the graph occurring, each node of the plurality of nodes being linked with another node of the plurality of nodes by a respective connecting line, the respective connecting line being attached to the respective linked nodes, by using a port on a respective one of the linked nodes, wherein, the processor is further configured to:
receive a user input of an update of the layout, the update including adding a node or a connecting line, moving a node or a connecting line, or resizing a node;
position the port only on a node affected by the update received and on a node connected with the node affected by the update received; and
route the connecting line between the node affected by the update received and the node connected based on the position of the port updated.
8 . The data processing system of claim 7 , wherein the an existing position of the port is unchanged on the node affected or on the node connected with the node affected, unless the node affected or the node connected is shrunk with at least one port outside of a boundary of the node affected or the node connected.
9 . The data processing system of claim 7 , wherein the connecting line is routed with priority of 1-segment routing, 3-segment routing and 5-segment routing.
10 . The data processing system of claim 9 , wherein the 1-segment routing is connecting two ports with one straight line without the one straight line overlapping any node of the plurality of nodes.
11 . The data processing system of claim 9 , wherein the 3-segment routing comprises connecting two ports by three straights lines without any of the three straight lines overlapping any node of the plurality of nodes, one line being vertically connected with another two lines extending from the two ports.
12 . The data processing system of claim 9 , wherein the 5-segment routing comprises connecting two ports by fine straights lines without any of the fine straight lines overlapping any node of the plurality of nodes, wherein, one line is vertically connected with two lines, each of the two lines being vertically connected with a line extending from one port.
13 . A non-transitory computer-readable medium encoded with executable instructions that, when executed, cause one or more data processing systems to partially update a layout of a graph for a plurality of nodes and respective connections between the plurality of nodes, upon a change to the graph occurring, each node of the plurality of nodes being linked with another node of the plurality of nodes by a respective connecting line, the respective connecting line being attached to the respective linked nodes, by using a port on one of the respective linked nodes, wherein, the executable instructions, when executed, cause one or more data processing systems to:
receive a user input of an update of the layout, the update including adding a node or a connecting line, moving a node or a connecting line, or resizing a node;
position the port only on the node affected by the update received and on the node connected with the node affected by the update received; and
route the connecting line between the node affected by the update received and the node connected based on the position of the port updated.
14 . The non-transitory computer-readable medium of claim 13 , wherein an existing position of the port is unchanged on the node affected or on the node connected with the node affected, unless the node affected or the node connected is shrunk with at least one port outside of a boundary of the node affected or the node connected.
15 . The non-transitory computer-readable medium of claim 13 , wherein the connecting line is routed with the priority of 1-segment routing, 3-segment routing and 5-segment routing.
16 . The non-transitory computer-readable medium of claim 13 , wherein the 1-segment routing is connecting two ports with one straight line, without the one straight line overlapping any node of the plurality of nodes.
17 . The non-transitory computer-readable medium of claim 13 , wherein the 3-segment routing comprises connecting two ports by three straights lines without any of the three straight lines overlapping any node of the plurality of node, one line being vertically connected with another two lines extending from the ports.
18 . The non-transitory computer-readable medium of claim 13 , wherein the 5-segment routing comprises connecting two ports by fine straights lines without any of the fine straights lines overlapping any node of the plurality of nodes, wherein, one line is vertically connected with two lines, each of the two lines being vertically connected with a line extending from one port.
19 . The method of claim 2 , wherein the connecting line is routed with the priority of 1-segment routing, 3-segment routing and 5-segment routing.
20 . The data processing system of claim 8 , wherein the connecting line is routed with the priority of 1-segment routing, 3-segment routing and 5-segment routing.