Skip to content

Releases: DeloitteOptimalReality/LightOSM.jl

v0.2.3

14 Jul 02:50
Compare
Choose a tag to compare

LightOSM v0.2.3

Diff since v0.2.2

Merged pull requests:

  • Subgraph generation performance improvement, test tidying (#73) (@bjmommers)

v0.2.2

13 Jul 05:08
Compare
Choose a tag to compare

LightOSM v0.2.2

Diff since v0.2.1

Merged pull requests:

  • Fixes for subgraph/GeoLocation/MetaGraph typing (#72) (@bjmommers)

v0.2.1

29 Jun 03:39
Compare
Choose a tag to compare

LightOSM v0.2.1

Diff since v0.2.0

Merged pull requests:

  • Add methods to create a sub-OSMGraph from an OSMGraph (#71) (@bjmommers)

v0.2.0

08 Jun 16:04
Compare
Choose a tag to compare

LightOSM v0.2.0

Diff since v0.1.19

Changes:

  • Improve Djkstra and A* performance using min heap instead of priority queue
  • Use correct exit conditions for Dijkstra and A*
  • Introduce breaking change to shortest_path interface and traversal functions astar and dijkstra, mainly to minimise allocations
  • Add cost_adjustment function as input to path finding, generalises restriction costs between u and v
  • Improve path_from_parents by tracking path length, allows preallocation of final array
  • Add graph utilities like index_to_node_id, more to come in the future
  • nearest_node updated so now only returns a single node for each point given. If a single point is given (whether a GeoLocation, vector of lat/lon, Node or node ID) then a tuple of (id, dist) is returned. If a vector of points is given, then a tuple of ([ids...], [dists...]) is returned.
  • Added nearest_nodes allows for the nearest n nodes. If a single point is given, returns a tuple of ([ids...], [dists...]). If a vector of points is given, returns a tuple of ([[ids...]...], [[dists...]...]).
  • Concretely type kdtree field of OSMGraph - improves performance
  • Quite a bit of refactoring including removing function return typing - we can let Julia work this out.
  • Rename highways to ways

Closed issues:

  • Refactor highways to ways in graphs (#18)
  • Change nearest_node API (#45)
  • shortest_path throws an error when no path is found (#61)
  • Try FastPriorityQueues.jl (#68)

Merged pull requests:

What's Changed

New Contributors

Full Changelog: v0.1.19...v0.2.0

v0.1.19

11 Nov 09:05
Compare
Choose a tag to compare

LightOSM v0.1.19

Diff since v0.1.18

Closed issues:

  • Switch to Graphs (#52)

Merged pull requests:

v0.1.18

12 Oct 05:05
Compare
Choose a tag to compare

LightOSM v0.1.18

Diff since v0.1.17

Closed issues:

  • Bug: oneway tag on non-oneway highways (#49)

Merged pull requests:

  • set default oneway to false, except roundabouts (#50) (@spcogg)

v0.1.17

28 Sep 07:05
Compare
Choose a tag to compare

LightOSM v0.1.17

Diff since v0.1.16

Merged pull requests:

  • Stop add_indexed_restrictions! from reversing order of nodes in way object (#48) (@mmiller-max)

v0.1.16

17 Sep 09:05
Compare
Choose a tag to compare

LightOSM v0.1.16

Diff since v0.1.15

Merged pull requests:

v0.1.15

26 Aug 15:06
Compare
Choose a tag to compare

LightOSM v0.1.15

Diff since v0.1.14

Merged pull requests:

  • Allow different weight matrices to be passed in for path weight calculations (#40) (@mmiller-max)
  • Add example stub for unit tests and stop download failures from breaking unit tests (#41) (@mmiller-max)
  • Stop shortest path returning no path when destination node is reached on suboptimal path (#42) (@mmiller-max)

v0.1.14

13 Aug 12:05
Compare
Choose a tag to compare

LightOSM v0.1.14

Diff since v0.1.13

Closed issues:

  • Keep having to manually run tagbot (#28)
  • Tests failing due to overpass being unavailable (#34)

Merged pull requests: