Hi Jay and Steve,<div><br></div><div>This email is getting very long, so I will shorten it a bit.<br><br></div><div><br><div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im">
<br>
* <a href="http://routingdemo.geofabrik.de/" target="_blank">http://routingdemo.geofabrik.de/</a><br>
* <a href="http://sourceforge.net/projects/routed/" target="_blank">http://sourceforge.net/projects/routed/</a><br>
<br>
It uses contraction hierarchies algorithm.<br>
<br>
<br>
<br>
Thanks for the links. Are you certain that the above project uses<br>
contraction hierarchies algorithm by Robert Geisberger? I went thru the<br>
source, and they are using contraction, but I did not see where they<br>
have used the node ordering step as proposed in the CH paper. I did not<br>
find contraction hierarchies mentioned in their readme too:<br>
<a href="http://sourceforge.net/apps/trac/routed/wiki/ReadMe" target="_blank">http://sourceforge.net/apps/trac/routed/wiki/ReadMe</a><br>
</div></blockquote>
<br>
It is possible that they read the paper and made their own implementation to avoid the AGPL license. The paper is describes the algorithms in great detail, so I'm sure this is possible.<div class="im"><br></div></blockquote>
<div><br></div><div>The notice I read through Twitter: <a href="http://twitter.com/#!/geofabrik/status/38579590834159616">http://twitter.com/#!/geofabrik/status/38579590834159616</a></div><div>According to this is uses CH. And the license is AGPL as well.</div>
<meta http-equiv="content-type" content="text/html; charset=utf-8"><div><br></div><div><br></div><div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div class="im">
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
If we are using the code already made available thru AGPL (I dont<br>
understand the intricacies of different licences) by Robert<br>
</blockquote>
<br></div>
I think we need to read and understand the AGPL license and how it might impact on the current license. These are tricky issues and it might prohibit us from including their code directly.<br>
<br>
If we wanted to do that we could still use the AGPL code to build test model that would allow us to validate the our code was getting reasonable results.</blockquote><div><br></div><div>As far as I understand AGPL is more strict than GPL in terms of services delivered with this software. So if you offer a routing service with this software, you need to also give access to the source code to the users of this service (GPL licensed software only cares about the software you pass to someone).</div>
<div>This is probably something that not every pgRouting user would be happy with.</div><div><br></div><div>Daniel</div><div><br></div></div><br>-- <br><span style="font-family:arial, sans-serif;font-size:13px;border-collapse:collapse">Georepublic UG & Georepublic Japan<br>
eMail: <a href="mailto:daniel.kastl@georepublic.de" style="color:rgb(66, 99, 171)" target="_blank">daniel.kastl@georepublic.de</a><br>Web: <a href="http://georepublic.de/" style="color:rgb(66, 99, 171)" target="_blank">http://georepublic.de</a></span><br>
</div>