[ad_1]
As you see, there’s a map and I need to pathfinding to establish which cities are appreciated one another.
The yellow tiles within the map are the Land, and blue ones are the ocean.
The purple font means there’s a waterway, and the inexperienced font means there
is a street. The right path ought to be linked as road-road, waterway-waterway,
road-harbor-waterway or waterway-harbor-road. Subsequently,
2,6City can hyperlink to 2,4City through (2,6City)-(1,6)-(0,6)-(1,5)-(2,5)-(3,4Harbor)-(2,4City),
2,6City can hyperlink to 0,0City through (2,6City)-(1,6)-(0,6)-(1,5)-(2,5)-(3,4Harbor)-(2,4City)–
(1,4)-(0,3City)-(0,2)-(0,1)-(0,0City),
2,6City can hyperlink to three,0City through (2,6City)-(1,6)-(0,6)-(1,5)-(2,5)-(3,4Harbor)-(3,3)–
(3,2)-(4,1Harbor)-(3,0City).
Nonetheless, once I use GKGridGraph to create a map for Pathfinding, I don’t know the right way to
inform the state of affairs that waterway isn’t accessible to street. You’ll be able to see, I DON‘T need:
2,6City can hyperlink to 2,4City through (2,6City)-(2,5)-(2.4City) or
2,4City is linked to 2,2City as a result of (2,4City)-(3,4Harbor)-(3,3)-(3,2)-(2,2City)
So, any suggestion? Thanks lots.
[ad_2]
