diff options
| author | Gard Spreemann <gspreemann@gmail.com> | 2018-06-14 20:39:01 +0200 |
|---|---|---|
| committer | Gard Spreemann <gspreemann@gmail.com> | 2018-06-14 20:39:01 +0200 |
| commit | c524232f734de875d69e2f190f01a6c976024368 (patch) | |
| tree | d8bba27646c367cb2b7c718354dd036892bcd629 /GudhUI/utils/K_nearest_builder.h | |
| parent | 9899ae167f281d10b1684dfcd02c6838c5bf28df (diff) | |
GUDHI 2.2.0 as released by upstream in a tarball.upstream/2.2.0
Diffstat (limited to 'GudhUI/utils/K_nearest_builder.h')
| -rw-r--r-- | GudhUI/utils/K_nearest_builder.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/GudhUI/utils/K_nearest_builder.h b/GudhUI/utils/K_nearest_builder.h index 7be0a4f4..14851d96 100644 --- a/GudhUI/utils/K_nearest_builder.h +++ b/GudhUI/utils/K_nearest_builder.h @@ -4,7 +4,7 @@ * * Author(s): David Salinas * - * Copyright (C) 2014 INRIA Sophia Antipolis-Mediterranee (France) + * Copyright (C) 2014 Inria * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by @@ -81,7 +81,7 @@ template<typename SkBlComplex> class K_nearest_builder { for (auto it = ++search.begin(); it != search.end(); ++it) { Vertex_handle q(std::get<1>(it->first)); if (p != q && complex_.contains_vertex(p) && complex_.contains_vertex(q)) - complex_.add_edge(p, q); + complex_.add_edge_without_blockers(p, q); } } } |