Graph services for program understanding tools

Many types of problems are more easily understood when represented with graphs. This paper presents an organization of graph theoretical functions for use by an application program. The paper covers a unified set of generalized routines and data structures for graph reductions, path analysis, and data flow problems. Some suggestions for user interfaces are provided. Examples of problems in which these functions might be used are program understanding, software testing, software design, scheduling, and network management.<
>