. . "1047649156"^^ . . . . . . . . . . . . . . . . . . "A call graph (also known as a call multigraph) is a control-flow graph, which represents calling relationships between subroutines in a computer program. Each node represents a procedure and each edge (f, g) indicates that procedure f calls procedure g. Thus, a cycle in the graph indicates recursive procedure calls."@en . . . . . . . . . . . . . . . . . . . . . . . "14658"^^ . . . . . . . . . . . . . . . . . . . . . . . . . "A call graph (also known as a call multigraph) is a control-flow graph, which represents calling relationships between subroutines in a computer program. Each node represents a procedure and each edge (f, g) indicates that procedure f calls procedure g. Thus, a cycle in the graph indicates recursive procedure calls."@en . . . . . . . . . . . . "3838181"^^ . . . . . "Call graph"@en . . . . . . .