Hi Steve,<div><br></div><div>I don't have enough time unfortunately to catch up with the number of ideas ... also I'm missing technical expertise for some RFC's ;-)</div><div>That's why I collected them here as a reminder: <a href="https://github.com/pgRouting/website/issues">https://github.com/pgRouting/website/issues</a> (not sure "website" repository is the right place though)</div>
<meta http-equiv="content-type" content="text/html; charset=utf-8"><div><br></div><div>I heard about some implementation, but don't really remember to have heard about MoNav.</div><div><br></div><div>Daniel</div><div>
<br></div><div><a href="https://github.com/pgRouting/pgrouting/issues"></a><br><br><div class="gmail_quote">2010/12/2 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 12/2/2010 12:08 AM, Daniel Kastl wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<br>
It would be interesting to enhance our single shortest path<br>
to be<br>
able to extract multiple single shortest paths based on a single<br>
graph build. So input might be something like<br>
<br>
<br>
This would be the same as k-Shortest Path, right?<br>
<a href="http://www.pgrouting.org/rfc/rfc-04.html" target="_blank">http://www.pgrouting.org/rfc/rfc-04.html</a><br>
<<a href="http://www.pgrouting.org/rfc/rfc-04.html" target="_blank">http://www.pgrouting.org/rfc/rfc-04.html</a>><br>
<br>
<br>
No, K-shortest paths is more like what google does when it gives you<br>
alternative routes. You start and end stay constant but you get the<br>
shortest, then the next shortest, etc<br>
<br>
I'm thinking of the case for example where you solve a TSP and now<br>
you want to extract the shortest paths from A-B, B-C, ... , Z-A and<br>
you only want to load and build the graph once but get back all the<br>
routes. You could probably think of it as via points. like<br>
start-A-B-C-D-end.<br>
You could run 5 separate queries to get all the route segments, or<br>
we could have a function that you pass it a set of path control<br>
points and it build one graph and resturns all the segments in one<br>
call. I thought you were referencing doing this in an earlier email.<br>
Regardless this would be much faster than dosing N separate queries<br>
and having to build the graph N times.<br>
<br>
You mean you request a route including points in between and return them<br>
all at once.<br>
This makes sense, that's true. I think there are many possibilities for<br>
addons. We should add it to the wishlist.<br>
</blockquote>
<br></div></div>
Yes, exactly. I'm not sure it requires a whole RFC, but we might want to add a wish list document to the RFC directory that would make it easy to add ideas to the wish list document.<br>
<br>
I just looked at the RFCs and notice that we do not have one for the contraction highway algorithm. Did you notice that that was implemented for OSM? MoNav is the project.<br>
<br>
-Steve<div><div></div><div class="h5"><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>
</div></div></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>