1. A computer-implemented method for merging graphical programs, the method comprising: receiving information regarding a first graphical program and a second graphical program, wherein the first graphical program comprises a first plurality of interconnected nodes that visually indicate functionality of the first graphical program, and wherein the second graphical program comprises a second plurality of interconnected nodes that visually indicate functionality of the second graphical program; analyzing the information to determine matches and differences between the first graphical program and the second graphical program; automatically merging the first graphical program and the second graphical program based on the determined matches and differences, thereby generating a merged graphical program, wherein the generating comprises determining spatial requirements for adding nodes in the merged graphical program by: determining a first circumscribing bound for at least some of the nodes of the first graphical program based on position information of the respective nodes in the first graphical program; determining a second circumscribing bound for at least some of the nodes of the second graphical program based on position information of the respective nodes in the second graphical program; and determining an offset reflecting the difference in size between the first and second circumscribing bounds; and determining a third circumscribing bound by modifying the first circumscribing bound by the determined offset and arranging at least some of the nodes of the merged graphical program in the third circumscribing bound; and displaying the merged graphical program on a display device.