机器人，谷歌地图，多段线，最短路径 [英] Android, google maps, polyline, shortest path

问题描述

我已经阅读堆栈溢出一些议题，但没有找到我的问题的精确解。
我会试着解释我的问题。例如，让说，我有一个9x9的网格。坐标重新由路口psented $ P $。
有没有一种方法或是否有人已经实现了再接一个过程，从坐标A（X，Y）协调B（V，W），其中该行重新presents的最短路径。

I have already read some topics on Stack Overflow but didn't found the exact solution for my problem. I will try to explain my problem. For example let say that I have a grid 9x9. The coordinates are represented by the junctions. Is there a method or did someone already implemented a procedure that draw a line from coordinate A (X, Y) to coordinate B (V, W) where the line represents the shortest path..

在我的问题，我使用谷歌地图，我想提请坐标之间的多线..

In my problem I am using Google Maps and I would like to draw a poly-line between coordinates..

这是类似我的问题，但在我的情况下，我想用坐标而不是权重

This is similar to my problem, but in my case I would like to use coordinates and not "weights"

<一个href=\"http://stackoverflow.com/questions/17480022/java-find-shortest-path-between-2-points-in-a-distance-weighted-map\">Java - 寻找2点之间的最短路径的距离加权地图

：）

推荐答案

如果您使用的是谷歌地图，那么你可以使用谷歌地图API.I希望这些链接会帮助你。

If you are using google map then you can use Google Directions API.I hope these links will help you.

http://javapapers.com/android/draw-路径上谷歌，地图，Android的API

https://developers.google.com/maps/documentation/directions/

这篇关于机器人，谷歌地图，多段线，最短路径的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！