Abstract: One embodiment of the present invention provides a system that refactors a port of a node in a graph, wherein the node has one or more input ports and one or more output ports. During operation, the system identifies an input port of the node to be refactored. The system then creates a pass-through node, wherein the value on an output port of the pass-through node equals the value on an input port of the pass-through node. Next, the system connects the output port of the pass-through node to the input port to be refactored, so that the refactored input port receives a value that is set on the input port of the pass-through node.

Abstract: One embodiment of the present invention provides a system that refactors a port of a node in a graph, wherein the node has one or more input ports and one or more output ports. During operation, the system identifies an input port of the node to be refactored. The system then creates a pass-through node, wherein the value on an output port of the pass-through node equals the value on an input port of the pass-through node. Next, the system connects the output port of the pass-through node to the input port to be refactored, so that the refactored input port receives a value that is set on the input port of the pass-through node.

Abstract: One embodiment of the present invention provides a system that dynamically adjusts the range of a navigational controller for an infinite workspace within a graphical display environment. During operation, the system determines that an object has moved from an original position to a new position with respect to a display area of the workspace. If the object at the new position is not contained within the display area of the workspace, the system expands the range of the navigational controller so that the object is contained in the display area of the workspace.

Abstract: One embodiment of the present invention provides a system that highlights differences between two graphs that represent programs in a graphical programming language. During operation, the system identifies unique nodes in the two graphs which are not identical to any other node in the other graph. Note that each of the two graphs comprises a set of interconnected nodes which represent functions in the graphical programming language. The system then displays the two graphs within the same editor window, and while doing so highlights nodes which do not have identical counterparts in the other graph.