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

Table 9

Variants of algorithms for calculating the shortest paths.

	Start vertices SV ⊂ V(G)	Finish vertices FV ⊂ V(G)	Search type
Algorithm 1	SV = {}	FV = {}	Single-source single-destination
Algorithm 2	SV = {, }	FV = {, }	Two-sources two-destinations
Algorithm 3	SV = {, }	FV = {}	Two-sources single-destination
Algorithm 4	SV = {}	FV = {, }	Single-source two-destinations