No.8 robot path planning problem in "network flow 24 questions"

Test instructions

Robot Rob can move freely on a tree-like path. Given the beginning S and the end point of the tree path T, the robot Rob is moving from S to T. There are several movable obstructions on the tree path T. Because of the narrow path, any moment in
The path cannot hold 2 objects at any one time. Each step can move an obstacle or robot to an adjacent empty vertex. An effective algorithm is designed to move the robot from S to T with a minimum number of movements.

Input File Example
Input.txt
5 0 3
1 1 2
1 1 2
1 3 0) 1 3
0 2 2 4
1 1 3

Output File Example
Output.txt
3

Analysis

Writing this question is just orz ...

Classic puzzles, not solved = =

Heard the network flow n^9?? But I don't even have a relationship with the Internet.

Then on-line with DP n^6 solution, as if very powerful, I will%%% good.

Http://wenku.baidu.com/link?url=TdDNL324rcCfUv7OanlaXtjjBQil5cxH4-x5A96T7o_ 47tfcfreayhi5qgz199seyryqqhsbcmcqp59ddvccfaglzdtz8ibhixtec-n65hu

If anyone is interested, look at it.

I'll get a whole.

2016-11-04 15:06:44

No.8 robot path planning problem in "network flow 24 questions"