How generate Call Graph and Dependency Graph
From the answers you've received above and, from my limited knowledge of Lazarus, I don't think Lazarus generates a procedure/function call graph for a program.
If you are familiar with AWK, it is fairly simple to generate the dependency sets from each function/procedure. From the dependency sets it's trivial to generate a call graph and a dependency graph.
There is one thing to be careful about, a topological sort is used to generate an ordered dependency graph, choose an algorithm that detects circular dependencies (most do) and handles them "gracefully" (some just stop, others can represent the cycle and continue sorting - the latter is obviously the kind of algorithm you want.)
Just FYI, way way back, TurboPower software had a product called Turbo Analyst which produced call graphs. I don't know if that is one of the products they open sourced after they closed shop. If it is available somewhere, it's likely it would need "improvements" to handle the FPC dialect but, for old Turbo Pascal code (circa TP6 and 7), it's likely to work without any changes.