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://www.roneverhart.com/Premium-Polyester-Square-Tablecloth-70-x70-White-220GSM-Wrinkle-Resistant-Table-Cover-for-Stylish-Gatherings/