summaryrefslogtreecommitdiff
path: root/src/Bipartite_graph_matching/include/gudhi/Layered_neighbors_finder.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/Bipartite_graph_matching/include/gudhi/Layered_neighbors_finder.h')
-rw-r--r--src/Bipartite_graph_matching/include/gudhi/Layered_neighbors_finder.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/Bipartite_graph_matching/include/gudhi/Layered_neighbors_finder.h b/src/Bipartite_graph_matching/include/gudhi/Layered_neighbors_finder.h
index 58805b86..8303627a 100644
--- a/src/Bipartite_graph_matching/include/gudhi/Layered_neighbors_finder.h
+++ b/src/Bipartite_graph_matching/include/gudhi/Layered_neighbors_finder.h
@@ -29,7 +29,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) in a layered graph layer given as parmeter.
@@ -73,7 +73,7 @@ inline int Layered_neighbors_finder::vlayers_number() const {
return static_cast<int>(neighbors_finder.size());
}
-} // namespace bottleneck
+} // namespace bipartite_graph_matching
} // namespace Gudhi