I will give an overview of the different combinatorial realisations of Dyck paths and parking functions and of some directions in which they can be generalised. Then I will construct a bijection between the two types of connected parking functions that were introduced by Shu Xiao last week.