-
Notifications
You must be signed in to change notification settings - Fork 9
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
13 additions
and
10 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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 |