Skip to content

Commit

Permalink
Add files via upload
Browse files Browse the repository at this point in the history
  • Loading branch information
vlarmet authored Jul 8, 2019
1 parent 3d4e9eb commit 4f5680c
Showing 1 changed file with 13 additions and 10 deletions.
23 changes: 13 additions & 10 deletions NEWS.md
Original file line number Diff line number Diff line change
@@ -1,15 +1,18 @@
NEWS
================
Vincent LARMET
8 juillet 2019

v1.2
====
cppRouting v1.2
===============

Major changes
- new functions `cpp_simplify`, `get_detour` and `to_df`

- new functions `cpp_simplify`, `get_detour` and `to_df`

Minor changes
- bug fix in `get_distance_pair` and `get_path_pair` : verify that origin / destination nodes are present in the graph before running c++ function
- modification of `get_distance_pair` and `get_path_pair` Rd. files : clearer explanation about the choice between algorithms
- optimization of `get_distance_matrix` function : if length(to) < length(from) then Dijkstra algorithm is ran from destination nodes on reversed graph

- bug fix in `get_distance_pair` and `get_path_pair` : verify that origin / destination nodes are present in the graph before running c++ function
- modification of `get_distance_pair` and `get_path_pair` Rd. files : clearer explanation about the choice between algorithms
- optimization of `get_distance_matrix` function : if length(to) < length(from) then Dijkstra algorithm is ran from destination nodes on reversed graph

cppRouting v1.1
===============

First CRAN release

0 comments on commit 4f5680c

Please sign in to comment.