We study the (Delta. D) and (Delta. N) problems for double-step digraphs considering the unilateral distance. which is the minimum between the distance in the digraph and the distance in its converse digraph. https://storeanimalwiz.shop/product-category/cleaning/