<div dir="ltr"><div>Thanks Steve . i will go through the steps that you have mentioned once i am free from all my academic commitments by the end of this month ( in 2-3 days at max).<br><br><br><br></div>-Mukul<br></div><div class="gmail_extra">
<br><br><div class="gmail_quote">On Sat, Apr 27, 2013 at 6:59 PM, Stephen Woodbridge <span dir="ltr"><<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Hi Mukul,<br>
<br>
I think your proposal looks good. Daniel may have some additional comment. At this point if you have time, you might want to start with getting a github account, forking the pgrouting project, making sure you can build the existing project and install it under pg 9.2.<br>
<br>
Regarding the Astar algorithm, you might want to look at implementing your own algorithm unless you want to try and work with the existing Boost code as this might be easier in the long run. Either way some research now, might help you with your planning later. This would allow you to work out all the basics of working in our environment and give you a head start. In the past the most successful and less stressed projects have been those that took an interest early on as these details can be frustrating and time consuming. This is totally at you option because the proposal has not been accepted yet.<br>
<br>
Thank you putting together an interesting proposal that would add value to the project.<br>
<br>
-Steve<div class="im"><br>
<br>
<br>
On 4/27/2013 6:29 AM, Mukul priya wrote:<br>
</div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im">
Hi steve , i have edited my proposal based on our previous discussion (<br>
added some lines about Astar) .meanwhile do suggest if there is scope of<br>
some improvement .<br>
<br>
Thanks<br>
<br>
Mukul<br>
<br>
<br>
<br>
<br>
<br>
On Thu, Apr 25, 2013 at 11:22 PM, Mukul priya <<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a><br></div><div class="im">
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a>>> wrote:<br>
<br>
Thanks Steve will add a few lines to my proposal explaining the<br>
reason behind opting Astar.<br>
<br>
<br>
<br>
<br>
Mukul<br>
<br>
<br>
On Thu, Apr 25, 2013 at 8:55 PM, Stephen Woodbridge<br></div><div><div class="h5">
<<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.com</a> <mailto:<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.<u></u>com</a>>> wrote:<br>
<br>
On 4/25/2013 11:06 AM, Mukul priya wrote:<br>
<br>
<br>
<br>
How much of the network do you have to explore using each<br>
algorithm?<br>
<br>
This will be reduced significantly while using Astar as we<br>
will have a<br>
fair bit of idea about the direction towards which we should<br>
proceed.<br>
<br>
How does this impact the number of grids you have to load?<br>
<br>
Once we have an idea about the direction towards which we<br>
should proceed<br>
, only those grids will be loaded. This will result in<br>
loading of less<br>
number of grids.<br>
<br>
How does this impact your proposal?<br>
The basic motivation behind the proposal is to make shortest<br>
path<br>
computation faster. Number of database querry will be<br>
reduced as we will<br>
be fetching lesser number of grids. This will have a<br>
positive effect on<br>
computation time.<br>
<br>
<br>
Right, so in your proposal, you want to be clear that the<br>
benefit will be achieved using astar or another algorithm with a<br>
heuristic and not dijkstra. I understand that "shortest path" is<br>
a generic reference to all of these algorithms, but the only<br>
ones that will benefit from this approach will be ones with a<br>
heuristic that allow us to explore only a subset the overall<br>
bounding box of edges that we might otherwise use as input. So<br>
it is best to be clear on these points.<br>
<br>
-Steve<br>
<br>
On Thu, Apr 25, 2013 at 7:07 PM, Stephen Woodbridge<br>
<<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.com</a> <mailto:<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.<u></u>com</a>><br></div></div>
<div class="im">
<mailto:<a href="mailto:woodbri@swoodbridge." target="_blank">woodbri@swoodbridge.</a>__<u></u>com<br>
<mailto:<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.<u></u>com</a>>>> wrote:<br>
<br></div><div class="im">
On 4/25/2013 12:26 AM, Mukul priya wrote:<br>
<br>
Thanks Steve ,I am familar with astar ,It uses a<br>
heuristic to guide<br>
itself to the destination, there was huge focus on<br>
it in our<br>
game theory<br>
course.<br>
<br>
Although do point out the advantages it has in real<br>
life road<br>
network<br>
and its importance to my proposal.<br>
<br>
<br>
How much of the network do you have to explore using<br>
each algorithm?<br>
How does this impact the number of grids you have to load?<br>
How does this impact your proposal?<br>
<br>
-Steve<br>
<br>
On Thu, Apr 25, 2013 at 7:43 AM, Stephen Woodbridge<br>
<<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.com</a><br>
<mailto:<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.<u></u>com</a>><br>
<mailto:<a href="mailto:woodbri@swoodbridge." target="_blank">woodbri@swoodbridge.</a>__<u></u>com<br>
<mailto:<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.<u></u>com</a>>><br></div><div class="im">
<mailto:<a href="mailto:woodbri@swoodbridge" target="_blank">woodbri@swoodbridge</a>.<br>
<mailto:<a href="mailto:woodbri@swoodbridge" target="_blank">woodbri@swoodbridge</a>.>_<u></u>___com<br>
<mailto:<a href="mailto:woodbri@swoodbridge." target="_blank">woodbri@swoodbridge.</a>__<u></u>com<br>
<mailto:<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.<u></u>com</a>>>>> wrote:<br>
<br></div><div class="im">
Hi Mukul,<br>
<br>
This is a good write up. It largely mirrors<br>
out discussion. One<br>
thing that needs to change in this is that<br>
dijkstra should be<br>
replaced with astar.<br>
<br>
Are you familiar with how these are different?<br></div>
<a href="http://theory.stanford.edu/~______amitp/GameProgramming/______AStarComparison.html" target="_blank">http://theory.stanford.edu/~__<u></u>____amitp/GameProgramming/____<u></u>__AStarComparison.html</a><br>
<<a href="http://theory.stanford.edu/%7E____amitp/GameProgramming/____AStarComparison.html" target="_blank">http://theory.stanford.edu/%<u></u>7E____amitp/GameProgramming/__<u></u>__AStarComparison.html</a>><br>
<br>
<<a href="http://theory.stanford.edu/%__7E__amitp/GameProgramming/____AStarComparison.html" target="_blank">http://theory.stanford.edu/%_<u></u>_7E__amitp/GameProgramming/___<u></u>_AStarComparison.html</a><br>
<<a href="http://theory.stanford.edu/%7E__amitp/GameProgramming/__AStarComparison.html" target="_blank">http://theory.stanford.edu/%<u></u>7E__amitp/GameProgramming/__<u></u>AStarComparison.html</a>>><br>
<br>
<br>
<<a href="http://theory.stanford.edu/%____7Eamitp/GameProgramming/____AStarComparison.html" target="_blank">http://theory.stanford.edu/%_<u></u>___7Eamitp/GameProgramming/___<u></u>_AStarComparison.html</a><br>
<<a href="http://theory.stanford.edu/%__7Eamitp/GameProgramming/__AStarComparison.html" target="_blank">http://theory.stanford.edu/%_<u></u>_7Eamitp/GameProgramming/__<u></u>AStarComparison.html</a>><div>
<div class="h5"><br>
<br>
<br>
<<a href="http://theory.stanford.edu/%__7Eamitp/GameProgramming/__AStarComparison.html" target="_blank">http://theory.stanford.edu/%_<u></u>_7Eamitp/GameProgramming/__<u></u>AStarComparison.html</a><br>
<<a href="http://theory.stanford.edu/%7Eamitp/GameProgramming/AStarComparison.html" target="_blank">http://theory.stanford.edu/%<u></u>7Eamitp/GameProgramming/<u></u>AStarComparison.html</a>>>><br>
<br>
<br>
Do you see why? and specifically why it matter<br>
for this<br>
project?<br>
<br>
-Steve<br>
<br>
On 4/24/2013 9:10 PM, Mukul priya wrote:<br>
<br>
***Name*:Mukul Priya<br>
<br>
*Country:*India<br>
<br>
*School and degree*: International<br>
Institute Of Information<br>
<br>
Technology-Hyderabad ,<br>
<br>
B.Tech +<br>
Masters in<br>
computer<br>
Science And<br>
Engineering<br>
<br>
*Email*:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a>><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a>>> <mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a>><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a>>>><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a>><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a>>> <mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a>><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a><br>
<mailto:<a href="mailto:mukul2047@gmail.com" target="_blank">mukul2047@gmail.com</a>>>><u></u>><br>
<br>
<br>
*Phone*:+91 9885991061<br>
<br>
*OSGeo project(s*):pgRouting<br>
<br>
*Title:* A partitioned approach to on<br>
demand increment<br>
graph<br>
assembly<br>
for pgRouting.<br>
<br>
*Describe your idea*<br>
*1. Introduction*<br>
<br>
<br>
pgRouting has been working<br>
towards providing<br>
routing<br>
functionality on a PostGis/PostgreSql Geo<br>
spatial<br>
<br>
database. It already has support for<br>
shortest path<br>
algorithm<br>
like<br>
astar ,dijkstra , tdsp and trsp .But for a<br>
very<br>
<br>
large network, routing becomes time<br>
consuming. Network<br>
partitioning<br>
is one such way which can prove to<br>
<br>
be helpful in improving the overall<br>
time efficiency<br>
of routing<br>
querries. The main idea here is to first<br>
partition<br>
<br>
the whole network using a Quad tree<br>
approach and<br>
when the<br>
shortest<br>
path is computed these partitions are<br>
<br>
loaded on demand. hence , there is an<br>
on demand<br>
incremental<br>
graph<br>
generation.<br>
<br>
<br>
The project aims at designing and<br>
implementing a<br>
Shortest Path<br>
algorithm on an on demand incremental<br>
<br>
Graph using a network partitioning<br>
approach.<br>
<br>
<br>
<br>
*2. Background*<br>
<br>
<br>
Considering the present status<br>
where pgRouting has<br>
support for<br>
shortest path algorithm like astar etc.<br>
<br>
Looking at their implementation details<br>
we can<br>
observe that<br>
the graph<br>
is configured dynamically for all<br>
<br>
of them before computation.My proposal<br>
will also be<br>
on the<br>
same track<br>
and for very large networks<br>
<br>
where the distance between source and<br>
destination<br>
can be<br>
very large ,<br>
the response time will be<br>
<br>
significantly lesser and memory wise<br>
too it will be<br>
lot more<br>
efficient. Presently they don't use any<br>
partitioning<br>
<br>
approach so it will prove to be a good<br>
addition to their<br>
support for<br>
shortest past algorithms.<br>
<br>
<br>
*3. The idea*<br>
<br>
<br>
There are two major components of my<br>
idea .<br>
<br>
<br>
*<br>
<br>
*Network Partitioning*<br>
<br>
<br>
For this part we can use a quad<br>
tree approach.<br>
Say , we<br>
start<br>
with a square and a condition like maximum<br>
<br>
number of nodes that can reside<br>
in a square .<br>
if the<br>
number of<br>
nodes in the square is greater than the max<br>
<br>
condition we further quarter it<br>
into four<br>
squares and<br>
allot the<br>
nodes appropriately to each of them.All these<br>
<br>
squares can be called grids and<br>
they all will<br>
be addressed<br>
uniquely using a grid cell number .Each node<br>
<br>
will be assigned a grid cell<br>
number based on<br>
the grid<br>
they are<br>
lying inside.<br>
<br>
<br>
We will have data<br>
structures to address<br>
edges as<br>
they can<br>
remain contained in either one grid cell<br>
<br>
or span across a number of grid<br>
cells.the<br>
idea is to<br>
first flag<br>
such edges and store the grid cell numbers<br>
<br>
of the grids that the edge<br>
crosses/intersects.<br>
<br>
<br>
*<br>
<br>
*On demand graph generation and Routing.*<br>
<br>
<br>
The idea here is to first<br>
identify the<br>
grid cell<br>
initially and then fetch the edges that<br>
are associated with<br>
<br>
that grid. These are the edges<br>
that will get<br>
appended<br>
to the<br>
present graph and the graph will keep growing<br>
<br>
dynamically this way. we will<br>
have appropriate<br>
database<br>
tables<br>
addressing the above issue such that<br>
<br>
we are able to fetch the required<br>
edges<br>
quickly using a<br>
database querry.<br>
<br>
<br>
The implementation details for<br>
the above are :<br>
<br>
we will first partition the whole<br>
graph using<br>
the quad tree<br>
approach and each node/vertex will be assigned<br>
<br>
a grid cell number so we can have<br>
database<br>
table for the<br>
assigned nodes and edges like :<br>
<br>
CREATE TABLE vertex{<br>
<br>
id Node_id<br>
\\<br>
unique<br>
for each<br>
node.<br>
<br>
cell grid_cell_number;<br>
\\ the<br>
grid in<br>
which the<br>
node lies.<br>
<br>
geometry;<br>
<br>
}<br>
<br>
<br>
CREATE TABLE edge {<br>
<br>
int id ;<br>
<br>
Int node_a;<br>
<br>
int node_b; \\ the<br>
connecting nodes<br>
<br>
// we can have other parameters like<br>
traversal cost<br>
and return<br>
cost.<br>
<br>
}<br>
<br>
using the tables we can then<br>
fetch the<br>
edges form<br>
edge table<br>
using simple database querry once<br>
<br>
we are provided with the grid cell<br>
number very easily.<br>
<br>
In short the summary of the whole idea is :<br>
<br>
<br>
Step1: Fetch the start node , get the<br>
related Grid cell<br>
number.<br>
<br>
<br>
Step 2: Increment the graph by fetching<br>
all the items<br>
related to<br>
that grid.<br>
<br>
<br>
Step3 : Check for boundary nodes ( this<br>
is done while<br>
we are<br>
partitioning) or target node .<br>
<br>
Step 4: On hitting a boundary node<br>
<br>
{<br>
<br>
check if the connected<br>
grid is<br>
loaded and<br>
continue if<br>
it is<br>
<br>
or we extend the graph<br>
with the new<br>
grid and<br>
continue<br>
with the routing;<br>
<br>
}<br>
<br>
or On hitting the target Node<br>
<br>
{<br>
<br>
stop;<br>
<br>
}<br>
<br>
<br>
<br>
*4. Project plan*<br>
<br>
<br>
I will have about 12 weeks to<br>
implement the<br>
project. The<br>
tentative<br>
schedule is as follows:<br>
<br>
Before 17th June : Get familiar<br>
with the development<br>
environment<br>
of pgRouting and test some demos.<br>
<br>
week 1-2: Discuss and Define the<br>
various data<br>
structures<br>
and data<br>
table that will be required.Prepare the<br>
<br>
Overall implementation<br>
architecture.<br>
<br>
<br>
week 3-4- Discuss and Implement<br>
network<br>
partitioning<br>
using quad<br>
tree.<br>
<br>
week 5-8 -Start coding for on<br>
demand graph<br>
generation and<br>
routing<br>
using Dijkstra. In between Prepare mid-term<br>
<br>
report.<br>
<br>
<br>
week 9 - Integration with pgrouting .<br>
<br>
week 10-12- Testing and Bug fixing.<br>
Draft Final<br>
report and<br>
documentation.<br>
<br>
<br>
*<br>
5. Future ideas / How can your idea be<br>
expanded? *<br>
<br>
<br>
<br>
It can be integrated with other<br>
shortest path<br>
algorithms<br>
like<br>
astar etc. which pgrouitng provides.For<br>
time dependent<br>
<br>
shortest path computation, it will<br>
greatly reduce the<br>
updating cost<br>
as we will be updating the cost of only<br>
those edges<br>
<br>
that are contained in the grid cells<br>
that are loaded.<br>
<br>
In route nearest neigbour querries<br>
can also be<br>
implemented using<br>
the partitioning approach.Overall we can<br>
<br>
expand this approach to various<br>
other algorithms.<br>
<br>
*Explain how your SoC task would benefit<br>
the OSGeo member<br>
project and<br>
more generally the OSGeo Foundation as a<br>
whole:*<br>
<br>
<br>
The proposed idea will significantly<br>
improve the<br>
performance of<br>
shortest path finding algorithms.This will<br>
have a<br>
<br>
positive effect on the user base of<br>
pgRouting. For<br>
various<br>
software<br>
paltforms or applications that are using<br>
this library ,<br>
<br>
the response time will significantly<br>
improve.<br>
<br>
*<br>
<br>
Please provide details of general<br>
computing experience:<br>
*<br>
<br>
<br>
I generally use ubuntu ( 12.04) for all my<br>
academic<br>
purposes and<br>
windows<br>
7 for entertainment only. I am familiar<br>
with Fedora also.<br>
<br>
C++ is the language that i use most (<br>
programming<br>
purposes). For<br>
implementing various course projects i<br>
have used C++<br>
,python<br>
,Java and<br>
matlab.<br>
<br>
<br>
I have no experience with hardware. The<br>
only experience<br>
that i<br>
had with<br>
networking was during my computer network<br>
course.<br>
<br>
*<br>
Please provide details of previous GIS<br>
experience:*<br>
<br>
<br>
<br>
I am a part of "Lab for Spatial<br>
Informatics" which is<br>
the only<br>
lab in<br>
India devoted to GIS applications and<br>
learning. I am<br>
familiar<br>
with and<br>
have used almost all the open source GIS<br>
platforms like<br>
Quantum ,<br>
OpenJump, ILwis,Grass. We have our own<br>
rendering<br>
platform that was<br>
developed by our lab.(LSI viewer)<br>
<br>
*Please provide details of any previous<br>
involvement<br>
with GIS<br>
programming<br>
and other software programming:*<br>
<br>
<br>
<br>
I am very much familiar with Gdal/OGR as<br>
i used it<br>
extensively<br>
while<br>
implementing an outsourced project of<br>
Honeywell<br>
<br>
Technology . I have played a lot with ESRI<br>
shape files.<br>
<br>
*Please tell us why you are interested in<br>
GIS and open<br>
source<br>
software:*<br>
<br>
<br>
<br>
I was very impressed with google earth<br>
when it was<br>
launched way<br>
back in<br>
2004.GIS platforms like quantum and<br>
Openjump were<br>
introduced to<br>
me when<br>
i was in my second year and then i joined<br>
Lab for spatial<br>
informatics<br>
that is in our college based on my<br>
interest in this area.<br>
<br>
<br>
open source platforms provide an<br>
opportunity to learn .<br>
The best<br>
part is<br>
you can always create or develop something<br>
that you are<br>
interested in<br>
and there are people who will always be<br>
there to help<br>
you if you<br>
are stuck.<br>
<br>
*<br>
<br>
Please tell us why you are interested in<br>
working for<br>
OSGeo and the<br>
software project you have selected:*<br>
<br>
<br>
<br>
It will be huge learning experience since<br>
i have been<br>
using<br>
platforms<br>
like Qgis , Gdal ,PostGis etc which come<br>
under Osgeo<br>
<br>
<br>
I chose pgrouting because the algorithms<br>
that they have<br>
implemented are<br>
related to my masters topic and it will be<br>
great if i<br>
get an insight<br>
about how these were implemented on a much<br>
larger scale.<br>
<br>
*Please tell us why you are interested in<br>
your specific<br>
coding<br>
project:*<br>
<br>
<br>
<br>
Implementing routing algorithms for real<br>
world networks is<br>
actually very<br>
challenging.its a challenge to come up<br>
with good<br>
approaches so<br>
that the<br>
computation cost and response time is both<br>
reduced.<br>
<br>
*Would your application contribute to your<br>
ongoing<br>
studies/degree? If<br>
so, how?*<br>
<br>
<br>
I am pursuing my Masters and my topic is<br>
closely<br>
related to my<br>
proposal<br>
. If the results are impressive , i might<br>
get a<br>
publication in<br>
this area.<br>
<br>
<br>
*Please explain how you intend to continue<br>
being an<br>
active member of<br>
your project and/or OSGeo AFTER the summer<br>
is over:*<br>
<br>
<br>
<br>
I was always interested in open source<br>
programming but<br>
never<br>
knew where<br>
to start . GSOC provides an opportunity<br>
for beginners<br>
like me<br>
to take a<br>
dive in the area open source programming.<br>
i have other<br>
ideas like<br>
implementing IRNN ( In route nearest neighbour<br>
querries) which<br>
can be<br>
implemented within pgRouting.I have other<br>
intentions like<br>
working for<br>
bigger projects like Quantum Gis or<br>
Grass.I will be<br>
contributing<br>
to the<br>
community forum and will always try to<br>
improve things.<br>
<br>
*Do you understand this is a serious<br>
commitment,<br>
equivalent to a<br>
full-time paid summer internship or summer<br>
job?*<br>
<br>
<br>
<br>
Yes, I understand that this is a serious<br>
commitment and<br>
will try<br>
to give<br>
my best and work in a professional manner.<br>
<br>
<br>
*Do you have any known time conflicts<br>
during the<br>
official coding<br>
period?<br>
(June 17 to Sept. 27)*<br>
<br>
<br>
<br>
No .<br>
<br>
<br>
<br>
<br>
<br>
On Thu, Apr 25, 2013 at 12:47 AM, Stephen<br>
Woodbridge<br>
<<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.com</a><br>
<mailto:<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.<u></u>com</a>><br>
<mailto:<a href="mailto:woodbri@swoodbridge." target="_blank">woodbri@swoodbridge.</a>__<u></u>com<br>
<mailto:<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.<u></u>com</a>>><br>
<mailto:<a href="mailto:woodbri@swoodbridge" target="_blank">woodbri@swoodbridge</a>.<br>
<mailto:<a href="mailto:woodbri@swoodbridge" target="_blank">woodbri@swoodbridge</a>.>_<u></u>___com<br>
<mailto:<a href="mailto:woodbri@swoodbridge." target="_blank">woodbri@swoodbridge.</a>__<u></u>com<br>
<mailto:<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.<u></u>com</a>>>><br></div></div>
<mailto:<a href="mailto:woodbri@swoodbridge" target="_blank">woodbri@swoodbridge</a><br>
<mailto:<a href="mailto:woodbri@swoodbridge" target="_blank">woodbri@swoodbridge</a>>.<br>
<mailto:<a href="mailto:woodbri@swoodbridge" target="_blank">woodbri@swoodbridge</a><br>
<mailto:<a href="mailto:woodbri@swoodbridge" target="_blank">woodbri@swoodbridge</a>>.><u></u>______com<div class="im"><br>
<br>
<br>
<mailto:<a href="mailto:woodbri@swoodbridge" target="_blank">woodbri@swoodbridge</a>.<br>
<mailto:<a href="mailto:woodbri@swoodbridge" target="_blank">woodbri@swoodbridge</a>.>_<u></u>___com<br>
<mailto:<a href="mailto:woodbri@swoodbridge." target="_blank">woodbri@swoodbridge.</a>__<u></u>com<br>
<mailto:<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.<u></u>com</a>>>>>> wrote:<br>
<br>
On 4/24/2013 2:34 PM, Mukul priya wrote:<br>
<br>
Hi Steve and Daniel ,<br>
<br>
I have posted my proposal on<br>
Melange Gsoc<br>
system. Do<br>
have a look<br>
at it.<br>
Waiting for feedback and suggestions.<br>
<br>
<br>
Can you post a link to your proposal?<br>
or the text<br>
of it<br>
here also. I<br>
can never find anything in Melange or<br>
I may not have<br>
visibility to<br>
it yet as I just applied as a mentor.<br>
<br>
Thanks,<br>
-Steve<br>
<br></div>
______________________________<u></u>_________________________<div class="im"><br>
<br>
<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>><br>
<mailto:<a href="mailto:pgrouting-dev@lists." target="_blank">pgrouting-dev@lists.</a>__<a href="http://osgeo.org" target="_blank"><u></u>osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>>><br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a>.<br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a>.>_<u></u>___<a href="http://osgeo.org" target="_blank">osgeo.org</a> <<a href="http://osgeo.org" target="_blank">http://osgeo.org</a>><br>
<mailto:<a href="mailto:pgrouting-dev@lists." target="_blank">pgrouting-dev@lists.</a>__<a href="http://osgeo.org" target="_blank"><u></u>osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>>>><br></div>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a>>.<br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a>>.><u></u>______<a href="http://osgeo.org" target="_blank">osgeo.org</a><br>
<<a href="http://osgeo.org" target="_blank">http://osgeo.org</a>> <<a href="http://osgeo.org" target="_blank">http://osgeo.org</a>><div class="im"><br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a>.<br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a>.>_<u></u>___<a href="http://osgeo.org" target="_blank">osgeo.org</a> <<a href="http://osgeo.org" target="_blank">http://osgeo.org</a>><br>
<mailto:<a href="mailto:pgrouting-dev@lists." target="_blank">pgrouting-dev@lists.</a>__<a href="http://osgeo.org" target="_blank"><u></u>osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>>>>><br></div>
<a href="http://lists.osgeo.org/________mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/_______<u></u>_mailman/listinfo/pgrouting-<u></u>dev</a> <<a href="http://lists.osgeo.org/______mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/______<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<<a href="http://lists.osgeo.org/______mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/______<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><u></u>>__><div class="im"><br>
<br>
<br>
<<a href="http://lists.osgeo.org/______mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/______<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><br></div>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><u></u>>__>__><div><div class="h5"><br>
<br>
<br>
<br>
<<a href="http://lists.osgeo.org/______mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/______<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><u></u>>__><br>
<br>
<br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/<u></u>mailman/listinfo/pgrouting-dev</a><u></u>>__>__>__><br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
______________________________<u></u>_______________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>><br>
<mailto:<a href="mailto:pgrouting-dev@lists." target="_blank">pgrouting-dev@lists.</a>__<a href="http://osgeo.org" target="_blank"><u></u>osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>>><br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a>.<br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a>.>_<u></u>___<a href="http://osgeo.org" target="_blank">osgeo.org</a> <<a href="http://osgeo.org" target="_blank">http://osgeo.org</a>><br>
<mailto:<a href="mailto:pgrouting-dev@lists." target="_blank">pgrouting-dev@lists.</a>__<a href="http://osgeo.org" target="_blank"><u></u>osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>>>><br>
<a href="http://lists.osgeo.org/______mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/______<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><u></u>>__><br>
<br>
<br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/<u></u>mailman/listinfo/pgrouting-dev</a><u></u>>__>__><br>
<br>
<br>
<br>
______________________________<u></u>_______________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>><br>
<mailto:<a href="mailto:pgrouting-dev@lists." target="_blank">pgrouting-dev@lists.</a>__<a href="http://osgeo.org" target="_blank"><u></u>osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>>><br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a>.<br>
<mailto:<a href="mailto:pgrouting-dev@lists" target="_blank">pgrouting-dev@lists</a>.>_<u></u>___<a href="http://osgeo.org" target="_blank">osgeo.org</a> <<a href="http://osgeo.org" target="_blank">http://osgeo.org</a>><br>
<mailto:<a href="mailto:pgrouting-dev@lists." target="_blank">pgrouting-dev@lists.</a>__<a href="http://osgeo.org" target="_blank"><u></u>osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>>>><br>
<a href="http://lists.osgeo.org/______mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/______<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><u></u>>__><br>
<br>
<<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/<u></u>mailman/listinfo/pgrouting-dev</a><u></u>>__>__><br>
<br>
<br>
<br>
<br>
______________________________<u></u>_____________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>><br>
<mailto:<a href="mailto:pgrouting-dev@lists." target="_blank">pgrouting-dev@lists.</a>__<a href="http://osgeo.org" target="_blank"><u></u>osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>>><br>
<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/<u></u>mailman/listinfo/pgrouting-dev</a><u></u>>__><br>
<br>
<br>
______________________________<u></u>_____________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>><br>
<mailto:<a href="mailto:pgrouting-dev@lists." target="_blank">pgrouting-dev@lists.</a>__<a href="http://osgeo.org" target="_blank"><u></u>osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>>><br>
<a href="http://lists.osgeo.org/____mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/____<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/<u></u>mailman/listinfo/pgrouting-dev</a><u></u>>__><br>
<br>
<br>
<br>
<br>
______________________________<u></u>___________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.osgeo.org</a><br>
<mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>><br>
<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<br>
______________________________<u></u>___________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.osgeo.org</a> <mailto:<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.<u></u>osgeo.org</a>><br>
<a href="http://lists.osgeo.org/__mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/__<u></u>mailman/listinfo/pgrouting-dev</a><br>
<<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/<u></u>mailman/listinfo/pgrouting-dev</a><u></u>><br>
<br>
<br>
<br>
<br>
<br>
______________________________<u></u>_________________<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/<u></u>mailman/listinfo/pgrouting-dev</a><br>
<br>
</div></div></blockquote><div class="HOEnZb"><div class="h5">
<br>
______________________________<u></u>_________________<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/<u></u>mailman/listinfo/pgrouting-dev</a><br>
</div></div></blockquote></div><br></div>