A Parallel Bioinspired Algorithm for Chinese Postman Problem Based on Molecular Computing

Algorithm 2

Judge the edges of the route.

	In the Chinese postman problem, each edge should be traversed at least once. In other words, a route cannot be a feasible path if it does not go through all the edges. We judge the information of the edge that the route passes by and screen out the routes that do not meet the restriction.
	For to
	For to
	(2-1)
	(2-2-1) ;
	(2-2-2) ;
	(2-2-3) ;
	(2-2-4) ;
	(2-2-5) ;
	(2-2-6) ;
	(2-2-7) ;
	Else
	(2-3) .
	End for
	End for