On Apr 26, 3:35 pm, "roshan.b.das" <[email protected]> wrote: > well i solved that problem by separating two coordintaes.Now the > problem i face is when the cong =1 still it is going through the > shortest path.How can that be resolved.Is it the problem with > GDirection object?
As far as I can tell you only call GDirections once. That time returns the shortest path (and doesn't avoid the congestion). -- Larry > Code is shown below:http://roshanbharathdas.googlepages.com/vertex2.htm > thanx again, > Roshan > > On Apr 27, 3:27 am, Andrew Leach <[email protected]> > wrote: > > > On Apr 26, 11:12 pm, Andrew Leach <[email protected]> > > wrote: > > > > Presumably it's supposed to do that. What's the problem? > > > No, that's nonsense. With different points I have a line which does go > > along your red line and where > > points[0] and points[1] appear to be identical to poly.getVertex(7) > > and (6) in that order. All four are GLatLngs and have identical > > values. > > > I think for objects you need an identity test > > poly.getVertex(7)===points[0] > > rather than an equality test > > poly.getVertex(7)==points[0] > > but that still evaluates as false. > > > You could use > > poly.getVertex(7).toString()==points[0].toString() > > which does return true, but it's a bit of a hack. > > > Andrew --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google Maps API" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/Google-Maps-API?hl=en -~----------~----~----~----~------~----~------~--~---
