Dynamic Automated Search of Shunting Routes within Mesoscopic Rail-Traffic Simulators

Table 4

Construction of edges belonging to the digraph G transformed from a related graph G₀.

Adjacent edges φ (ex) ∩ φ (ey) ≠ ∅; ex,ey ∈ E(G0), ex ≠ ey	Constructed transit edges Etrans (G)	Constructed reverse edges
		Erev (G)	Only if
=	[, ], [, ]	[, ]	∈ Vdest (G)
		[, ]	∈ Vdest (G)
=	[, ], [, ]	[, ]	∈ Vdest (G)
		[, ]	∈ Vdest (G)
=	[, ], [, ]	[, ]	∈ Vdest (G)
		[, ]	∈ Vdest (G)
=	[, ], [, ]	[, ]	∈ Vdest (G)
		[, ]	∈ Vdest (G)