1. A method for generating self-organizing layouts of process diagrams, the method comprising: randomly selecting, by one or more processors, initial spatial position vectors, w i , for all graphical nodes in a process diagram, wherein each graphical node in the process diagram has an initial spatial position vector associated therewith, wherein a first node in the process diagram is in a first lane of the process diagram, and wherein a second node in the process diagram is in a second lane of the process diagram; distributing, by one or more processors, the initial spatial position vectors, w i , uniformly within boundaries of multiple regions in the process diagram; in each region in the process diagram, randomly generating, by one or more processors, a spatial input vector, x, within the boundaries of each region; in each region in the process diagram, locating, by one or more processors, a closest graphical node, w c , to a random input vector generated in said each region; in each region in the process diagram, adjusting, by one or more processors, a position of a winning graphical node that is the closest graphical node to the random input vector generated in said each region, wherein said adjusting the position of the winning graphical node brings the winning graphical node closer to the random input vector; adjusting, by one or more processors, a weighted vector associated with each immutable closest graphical node in the process diagram, wherein each immutable closest graphical node w c has a fixed location on the process diagram; adjusting, by one or more processors, positions of all non-immutable graphical objects in a topographical neighborhood N(k) of the closest graphical node w c that can cross a boundary of one or more regions from the multiple regions in the process diagram; one or more processors, randomly generating the spatial input vector x, locating the closest graphical node w c , adjusting the position of the winning graphical node, and adjusting positions of all non-immutable graphical objects in the topographical neighborhood N(k) in a recursive manner until a maximum number of iterations, k max is reached; and flipping, by one or more processors, an arrangement of nodes in the second lane such that the first node and the second node are proximate to one another and are connected by a connector that does not overlap any other connectors in the second lane.