code for shortest path tree is fine with any mesh, not only surfaces

mlivesu · Nov 24, 2023 · f3f5cc0 · f3f5cc0
1 parent 8a09ac6
commit f3f5cc0
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/include/cinolib/shortest_path_tree.cpp b/include/cinolib/shortest_path_tree.cpp
@@ -48,7 +48,7 @@ namespace cinolib
 
 template<class M, class V, class E, class P>
 CINO_INLINE
-void shortest_path_tree(AbstractPolygonMesh<M,V,E,P> & m, const uint root, std::vector<bool> & tree)
+void shortest_path_tree(AbstractMesh<M,V,E,P> & m, const uint root, std::vector<bool> & tree)
 {
     // if true, the edge is on the tree
     tree = std::vector<bool>(m.num_edges(), false);

diff --git a/include/cinolib/shortest_path_tree.h b/include/cinolib/shortest_path_tree.h
@@ -50,7 +50,7 @@ namespace cinolib
 
 template<class M, class V, class E, class P>
 CINO_INLINE
-void shortest_path_tree(AbstractPolygonMesh<M,V,E,P> & m, const uint root, std::vector<bool> & tree);
+void shortest_path_tree(AbstractMesh<M,V,E,P> & m, const uint root, std::vector<bool> & tree);
 
 }