Call Graphs
A call graph is a representation that denotes possible invocations of subprograms in a system
- Nodes correspond to subprograms
- Directed arcs indicate that the subprogram at the source of the arc invokes the subprogram at the target of the arc
Depending on the structure of a system, its call graph may be a tree, a DAG (directed acyclic graph) or a general graph
Real systems may have large graphs that have to be abstracted