[pgrouting-dev] [SoC] GSOC'13- pgrouting weekly report 6:A partitioned approach to on demand increment graph assembly for pgRouting.

Hi everyone,

Here is my weekly report 6:

### What did i do this week ??

  • Reimplemented the partition retrieval mechanism so that regularly the partition can be fetched whenever demand arises and we don’t have to make ant recursive SPI_calls ( inbuilt function which talks to database). Made few changes to the solver class which constructs the graph and computes the path. still in the process of making those changes .

### What will I be working on next week ?

  • Try and complete implementing the solver class.

### Did I meet with any stumbling blocks?

  • Basic implementation issue that was solved through discussion with Steve.

### Any changes in schedule required ??

  • No i don’t think any change is required . I devoted week 5-8 for solver class implementation. I will have my solver class completed by then.

weekly report 6 [1]

All reports [2]

Code repository [3]

[1] https://github.com/pgRouting/pgrouting/wiki/Gsoc-2013-mukul-priya-r6
[2] https://github.com/pgRouting/pgrouting/wiki/Gsoc-2013-Mukul-Priya
[3] https://github.com/pgRouting/pgrouting/tree/gsoc-partition/src/partition