Method and apparatus for refactoring a graph in a graphical programming language

A method for refactoring a port of a node in a graph, wherein the node has one or more input ports and one or more output ports, the method comprising:

• identifying an output port of the node to be refactored;
• creating 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;
• connecting the output port of the node to be refactored to the input port of the pass-through node, so that the output port of the pass-through node matches a value on the refactored output port;
• and
• using the output port of the pass-through node in place of the refactored output port.

A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for refactoring a port of a node in a graph, wherein the node has one or more input ports and one or more output ports, the method comprising:

• identifying an input port of the node to be refactored;
• creating 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;
• and
• connecting 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.

A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for refactoring a port of a node in a graph, wherein the node has one or more input ports and one or more output ports, the method comprising:

• identifying an output port of the node to be refactored;
• creating 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;
• connecting the output port of the node to be refactored to the input port of the pass-through node, so that the output port of the pass-through node matches a value on the refactored output port;
• and
• using the output port of the pass-through node in place of the refactored output port.

An apparatus 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, comprising:

• an identification mechanism configured to identify an input port of the node to be refactored;
• a creation mechanism configured to create 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;
• and
• a connection mechanism configured to connect 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.

An apparatus 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, comprising:

• an identification mechanism configured to identify an output port of the node to be refactored;
• a creation mechanism configured to create 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;
• a connection mechanism configured to connect the output port of the node to be refactored to the input port of the pass-through node, so that the output port of the pass-through node matches a value on the refactored output port;
• and
• a utilization mechanism configured to use the output port of the pass-through node in place of the refactored output port.