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.
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.