search

kuanb / peartree

peartree: A library for converting transit data into a directed graph for sketch network analysis.
MIT License
201 stars 23 forks source link

Do not prune trips with just one arrival time #143

Closed kuanb closed 5 years ago

kuanb commented 5 years ago

When calculating node wait times, do not drop nodes that have just one wait time associated with them. For these, replace with the user-defaulted fallback wait time value.

Fixes https://github.com/kuanb/peartree/issues/139

TODO: Add tests specifically around there being only one stop time associated with that stop wait time estimate.

codecov[bot] commented 5 years ago

Codecov Report

Merging #143 into master will increase coverage by <.01%. The diff coverage is 100%.

Impacted file tree graph

@@            Coverage Diff             @@
##           master     #143      +/-   ##
==========================================
+ Coverage   91.72%   91.73%   +<.01%     
==========================================
  Files          13       13              
  Lines        1112     1113       +1     
==========================================
+ Hits         1020     1021       +1     
  Misses         92       92
Impacted Files Coverage Δ
peartree/summarizer.py 97.51% <100%> (+0.01%) :arrow_up:

Continue to review full report at Codecov.

Legend - Click here to learn more Δ = absolute <relative> (impact), ø = not affected, ? = missing data Powered by Codecov. Last update 6ea6e16...18c4cd6. Read the comment docs.