diff options
Diffstat (limited to 'src/Bipartite_graph_matching/include/gudhi/Neighbors_finder.h')
| -rw-r--r-- | src/Bipartite_graph_matching/include/gudhi/Neighbors_finder.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/Bipartite_graph_matching/include/gudhi/Neighbors_finder.h b/src/Bipartite_graph_matching/include/gudhi/Neighbors_finder.h index be81877a..879ba300 100644 --- a/src/Bipartite_graph_matching/include/gudhi/Neighbors_finder.h +++ b/src/Bipartite_graph_matching/include/gudhi/Neighbors_finder.h @@ -30,7 +30,7 @@ namespace Gudhi { -namespace bottleneck { +namespace bipartite_graph_matching { /** \internal \brief data structure used to find any point (including projections) in V near to a query point from U * (which can be a projection). @@ -107,7 +107,7 @@ inline std::unique_ptr< std::list<int> > Neighbors_finder::pull_all_near(int u_p return all_pull; } -} // namespace bottleneck +} // namespace bipartite_graph_matching } // namespace Gudhi |