> Maybe you should take a closer look at what pprof does and not draw conclusions only from Python's line_profiler. Go's profiler doesn't have flamegraphs, but it has directed graphs.
Python profilers have directed graph representations, they are little better than the normal textual output.
> As you can see, it is very easy to see the bottlenecks.
With trivial programs, the most terrible representations are no issue. Cycles in callstacks (partial mutual recursion) or "hot nodes" (dispatcher code) completely break directed graph output, but not flamegraphs.
Python profilers have directed graph representations, they are little better than the normal textual output.
> As you can see, it is very easy to see the bottlenecks.
With trivial programs, the most terrible representations are no issue. Cycles in callstacks (partial mutual recursion) or "hot nodes" (dispatcher code) completely break directed graph output, but not flamegraphs.