  Recently, the selection-recombination equation with a single selected site
and an arbitrary number of neutral sites was solved by \citet{Selrek} via the
ancestral selection-recombination graph. Here, we introduce a more accessible
approach, namely the ancestral initiation graph, in the special case where the
fitness of an individual is determined by the leading site. The construction is
based on a discretisation of the differential equation. Furthermore, we revisit
the dynamics of the linkage equilibria between two neutral loci hitchhiking
along with a selected one, and the dependence on the position of the selected
site.
