Optimal Automatic Drawing of One-Line Diagrams

An optimal one-line diagram generator algorithm is presented. The corresponding cctputer program drives the output device to draw a one-line diagram which is optimal in the sense that for a given drawing area, the minimum distance between elements of the diagram is a maximum. The computer program needs little additional information about the topology of the network to that normally supplied to a load flow program. The problem is posed and solved as a longest path problem. Examples of results of this program coupled to a load flow program are presented.