Multiparking functions, graph searching, and the Tutte polynomial

A parking function of length n is a sequence (b1,b2,…,bn) of non-negative integers for which there is a permutation π∈Sn so that 0⩽bπ(i)