A call graph (also known as a call multigraph) is a directed graph (and more specifically a flow graph) that represents calling relationships between subroutines in a computer program. Specifically, each node represents a procedure and each edge (f, g) indicates that procedure f calls procedure g.