diff options
Diffstat (limited to 'src/Bipartite_graph_matching/include/gudhi/Planar_neighbors_finder.h')
-rw-r--r-- | src/Bipartite_graph_matching/include/gudhi/Planar_neighbors_finder.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/Bipartite_graph_matching/include/gudhi/Planar_neighbors_finder.h b/src/Bipartite_graph_matching/include/gudhi/Planar_neighbors_finder.h index e403735c..60a1dd96 100644 --- a/src/Bipartite_graph_matching/include/gudhi/Planar_neighbors_finder.h +++ b/src/Bipartite_graph_matching/include/gudhi/Planar_neighbors_finder.h @@ -31,7 +31,7 @@ namespace Gudhi { -namespace bottleneck { +namespace bipartite_graph_matching { /** \internal \brief Structure used to find any point in V near (according to the planar distance) to a query point from U. * @@ -125,7 +125,7 @@ inline int Naive_pnf::pull_near(int u_point_index) { return null_point_index(); } -} // namespace bottleneck +} // namespace bipartite_graph_matching } // namespace Gudhi |