beckn / trip-stitching-algorithm

This contains the algorithm to stitch trips returned from multiple service providers int one single journey.
1 stars 2 forks source link

Distance based ranking #2

Open Har-sh-arma opened 8 months ago

Har-sh-arma commented 8 months ago

Paths are Ranked (by path length, checking if their are transfers) Missing links are Ranked(by their number of occurrences in smallest paths, and not transferable)

Has some implementation redundancies.

Adding other attributes like cost and duration should be similar , Just there will be multiple graphs representing cost and duration etc.

There wont be any cost for a transfer.

Har-sh-arma commented 8 months ago

Has progress on #1