Meeting 30 May: Discussion on pgr_areaContraction

[thisisashukla]

Discussion on creating pgr_areaContraction

• [x] Create function pgr_areaContraction
  • Function can imitate many-to-many Dijkstra as areaContraction is supposed to give many-to-many shortest paths between border vertices
• [x] Compare generated template code to derive changes to be made to suit the new function signature
• [x] Fit the results to contract_rt
• [ ] Look for common code between pgr_areaContraction and pgr_dijkstraTRSP
• Common paths between border vertices pairs can be of two types:
  • Common by Vertices
  • Common by Edges
• [x] Study signature of contraction designed by Rohith
• [x] Generate a function template
• Restricted nodes have two meanings:
  • They can not be contracted
  • Many-to-many Dijkstra have to be calculated between them
• [ ] Automatically generate proof of concept in documentation
• [x] Create function and make PR to Vicky's GSoC 2.5 branch