Highlights the most expensive path in function+descendants time (F+D) from the selected function, procedure, or method to the root node of the call graph.

(C) Copyright IBM Corporation 1993, 2009.