<br><br><div class="gmail_quote">On Thu, May 12, 2011 at 8:08 PM, Stephen Woodbridge <span dir="ltr"><<a href="mailto:woodbri@swoodbridge.com">woodbri@swoodbridge.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
<div><div></div><div class="h5"><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
*Few thoughts regarding implementation:*<br>
<br>
Most important detail which needs to be finalised is the implementation<br>
of dynamic weight map.<br>
<br>
1. Now, since the weight is function of time, the weight map is now like:<br>
<br>
Key: (Edge , Time) - Since edge and time will form a unique key.<br>
Value: weight<br>
<br>
Is this interpretation reasonable?<br>
</blockquote><br>
<br></div></div>
This seems reasonable. The only extension to this that would be valuable would to add a "class" to the key to allow filtering by traveler class. So something like Key: (Class, Edge, Time) where the default class is "Any". Hmmm, on second thought, it might be a better abstraction to use the Boost Filtered Graph to do this and keep your code simple because it is working in a tighter loop.<div class="im">
<br></div></blockquote><div><br>Can you please explain what exactly do you mean by traveler class? Is it like - bus, 2-wheeler etc (they might have different costs at same time) . <br><br>I am assuming that user will query only those entries(Edge,Time) that are useful. So, if he is querying for 2-wheeler, he should specify that in query, so that only entries related to that class are passed to boost graph and rest are filtered out already. <br>
</div><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;"><div class="im"><br></div></blockquote></div><br clear="all"><br>-- <br>Regards,<br>-Jay Mahadeokar<br>
<br>