performs dfs over the heap graph, starting from the given nodes

namespace HH;

function heapgraph_dfs_nodes(
  resource $heapgraph,
  array<int> $roots,
  array<int> $skips,
  mixed $callback,
): void;

calls back on every new node in the scan.


  • resource $heapgraph - the resource obtained with heapgraph_create
  • array<int> $roots - node indexes to start the scan from
  • array<int> $skips - node indexes to consider as if they're not there
  • mixed $callback - function(array<string, mixed> $node): void {} See documentation for heapgraph_edge() about the "edge" array passed to $callback


  • void