Hi Jay,<div><br></div><div>I think Boost License won't make troubles if you use it:</div><div><meta http-equiv="content-type" content="text/html; charset=utf-8"><a href="http://www.boost.org/users/license.html#FAQ">http://www.boost.org/users/license.html#FAQ</a></div>
<div><br></div><div>It's written that some libraries within Boost use their own licenses (<a href="http://www.boost.org/users/license.html#Introduction">http://www.boost.org/users/license.html#Introduction</a>), so it's probably a good idea to reconfirm quickly each time you want to make use of it.</div>
<div><br></div><div>Daniel</div><div><br></div><meta http-equiv="content-type" content="text/html; charset=utf-8"><div><a href="http://www.boost.org/users/license.html#FAQ"></a><br><br><div class="gmail_quote">2011/4/30 Stephen Woodbridge <span dir="ltr"><<a href="mailto:woodbri@swoodbridge.com">woodbri@swoodbridge.com</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div><div></div><div class="h5">On 4/29/2011 5:03 PM, Jay Mahadeokar wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Hi.<br>
<br>
As already discussed in the proposal for Time Dependent Shortest Path<br>
(TDSP) basically core part would be the extension of basic dijkstra<br>
algorithm to work for time dependent edge weights.<br>
<br>
This will involve a major change in the usual approach of pgRouting in<br>
the sense that no boost algorithm for time dependent edge weights is<br>
already implemented. So, we have to code the core algorithm ourselves.<br>
<br>
I was looking at the boost implementation of dijkstra algorithm here:<br>
<a href="http://www.boost.org/doc/libs/1_46_1/boost/graph/dijkstra_shortest_paths.hpp" target="_blank">http://www.boost.org/doc/libs/1_46_1/boost/graph/dijkstra_shortest_paths.hpp</a><br>
I figured we can reuse much of the code and ideas.<br>
<br>
Before I look deeper into the code, and see how we can modify it to make<br>
it time dependent, I wanted to know: if we reuse the static boost<br>
dijkstra code (and some other code that would be required with it), will<br>
there be any licencing issues?<br>
</blockquote>
<br></div></div>
Boost has a very liberal license and since we are already including boost code in pgRouting, I do no think it should be a problem.<br>
<br>
I assume the "some other code" you reference would be code that you write for the project? If so then this should not be a problem.<br>
<br>
-Steve<br>
_______________________________________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/mailman/listinfo/pgrouting-dev</a><br>
</blockquote></div><br><br clear="all"><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>