Florent Lamiraux authored Apr 07, 2018 and Joseph Mirabel committed Apr 09, 2018

  - implement method in Basic, abort in KDTree,
  - add api in Roadmap class to access various k nearest neighbors search
    methods,
  - add weak pointer to itself in Roadmap.

Joseph Mirabel authored May 15, 2017 and Joseph Mirabel committed May 15, 2017

* goal nodes is a vector, not a list
* addGoalNode returns a NodePtr_t

Joseph Mirabel authored Aug 28, 2015 and Joseph Mirabel committed Aug 28, 2015

* The shared pointer refered to might be deleted, without the underlying
* object being deleted. This situation creates an invalid reference.

  - classes are now distributed into modules for clarity.

Conflicts:

	include/hpp/core/collision-path-validation-report.hh
	include/hpp/core/collision-validation-report.hh
	include/hpp/core/inequality.hh
	include/hpp/core/path-optimization/gradient-based.hh
	include/hpp/core/validation-report.hh

  - classes are now distributed into modules for clarity.

  - two implementations: nearestNeighbor::KDTree and nearestNeighbor::Basic.
  - update test accordingly.
  - use nearestNeighbor::Basic by default since nearestNeighbor::KDtree fails
    with benchmark 2014/09/27/pr2_in_iai_kitchen.

  - KDTree is an internal class that does not need to be exposed to users.

  - move operator inside namespaces,
  - operator<< calls method print defined in the classes.

  - when creating a new node and connecting it both ways to another node, the
    new node is simply added to the connected component of the previously
    existing one.

  User do not need this class.

  - new implementation of connected components.

  - re-indent files before inserting directed roadmap,
  - delete trailing white spaces.

  - For clarity, define two methods instead of using default parameters:
     Roadmap::addNode,
     Roadmap::nearestNode,
     Node::Node.
  - Computation are unchanged.

  cut dependency to kitelab and jrl-dynamics,
  implement roadmap, problem, path planner...