<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<div class="moz-cite-prefix">Ssee FastestWeighting and
ShortestWeighting. To use a custom weighting you extend the
GraphHopper class (method createWeighting).<br>
<br>
Regards,<br>
Peter.<br>
<br>
</div>
<blockquote
cite="mid:CAH_H74njmXWBeZkC+k6JAR9aRoGXLQDzarQ5a0mqosnMGCH=pg@mail.gmail.com"
type="cite">
<div dir="ltr">Hello everybody,
<div><br>
</div>
<div>I don't fully understand how does weighting works in
Graphhopper. </div>
<div>As for 'shortest' path it's, I think, easy - it just simply
compares distances between nodes and that's it. </div>
<div>but what about when it comes to 'shortest' path?</div>
<div><br>
</div>
<div>Does the algorithm goes node by node and during each
iteration it calculates time from distance & average speed
for that node and then it compares those time values?</div>
<div>Sorry if that's a dumb question but I just can't follow the
code.</div>
<div><br>
</div>
<div>my goal is to manipulate those time values a bit so I want
to know where exactly should I do that? Inside Dijkstra.java
or somehow during GHRequest? </div>
<div><br>
</div>
<div>thank you </div>
<div><br>
</div>
<div> </div>
</div>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<br>
<pre wrap="">_______________________________________________
GraphHopper mailing list
<a class="moz-txt-link-abbreviated" href="mailto:GraphHopper@openstreetmap.org">GraphHopper@openstreetmap.org</a>
<a class="moz-txt-link-freetext" href="https://lists.openstreetmap.org/listinfo/graphhopper">https://lists.openstreetmap.org/listinfo/graphhopper</a>
</pre>
</blockquote>
<br>
</body>
</html>