The NETDRAW Procedure
- Overview
- Getting Started
-
Syntax
-
Details
Network Input Data Set Variables in the Network Data Set Missing Values Layout of the Network Format of the Display Page Format Layout Data Set Controlling the Layout Time-Scaled Network Diagrams Zoned Network Diagrams Organizational Charts or Tree Diagrams Full-Screen Version Graphics Version Using the Annotate Facility Web-Enabled Network Diagrams Macro Variable ORNETDR Computer Resource Requirements ODS Style Definitions
-
Examples
Line-Printer Network Diagram Graphics Version of PROC NETDRAW Spanning Multiple Pages The COMPRESS and PCOMPRESS Options Controlling the Display Format Nonstandard Precedence Relationships Controlling the Arc-Routing Algorithm PATTERN and SHOWSTATUS Options Time-Scaled Network Diagram Further Time-Scale Options Zoned Network Diagram Schematic Diagrams Modifying Network Layout Specifying Node Positions Organizational Charts with PROC NETDRAW Annotate Facility with PROC NETDRAW AOA Network Using the Annotate Facility Branch and Bound Trees Statement and Option Cross-Reference Tables
- References
| Computer Resource Requirements |
There is no inherent limit on the size of the network that can be drawn with the NETDRAW procedure. Naturally, a sufficient amount of core memory must be available in order to invoke and initialize the SAS system. Furthermore, the amount of memory required depends on the mode of invocation of the procedure. As far as possible, the procedure attempts to store all the data in core memory. However, if the problem is too large to fit in core memory, the procedure resorts to the use of utility data sets and swaps between core memory and utility data sets as necessary.
The storage requirement for the data area required by the procedure is proportional to the number of nodes and arcs in the network. The memory required is further increased by the use of the DP option in the ACTNET statement. Recall that this option requests the use of a dynamic programming algorithm to route the arcs between the nodes, and such algorithms tend to grow exponentially with the size of the problem being solved.