Abstract: Call graph is used to represent the call relationship of procedures in a program.It plays a very important role in program analysis and program transformation.In this paper,we first discuss the construeture of call graph of simple cases,and then propose the concepts of procedure vector and its mapping function.Based on these two concepts,we have given an algorithm to construct the Call graph in case of procedures can be used as procedure arguments.Our deep discussion shows that the time complexity of the algorithm is O（n）.Finally,we discuss the program dependence analysis based on call graph.