The data structure used for nearly all the algorithms in kdl_codyco is named "TreeGraph", that does not mean anything .
To avoid generating confusion in the users it should be renamed UndirectedTree, that make immediately clear the main difference between KDL::CoDyCo::UndirectedTree and KDL::Tree (which instead is a directed tree).
The data structure used for nearly all the algorithms in kdl_codyco is named "TreeGraph", that does not mean anything . To avoid generating confusion in the users it should be renamed UndirectedTree, that make immediately clear the main difference between KDL::CoDyCo::UndirectedTree and KDL::Tree (which instead is a directed tree).