songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

shorted some lines

This commit is contained in:
Andreas Fabri 2003-06-27 20:28:49 +00:00
parent 2c741575d5
commit f6b41b8d16
1 changed files with 10 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
Packages/Point_set_2/include/CGAL/Point_set_2.h
View File

@ -38,7 +38,8 @@
CGAL_BEGIN_NAMESPACE
// compare function objects for the priority queues used in nearest neighbor search
// compare function objects for the priority queues
// used in nearest neighbor search
template<class VP, class NT,class MAP_TYPE>
class compare_vertices {
public:
@ -172,7 +173,9 @@ public:
act = vc;
if (! is_infinite(act)) {
if ( tr_comparedist(p,act->point(), min_v->point()) == SMALLER ) min_v = act;
if ( tr_comparedist(p,act->point(), min_v->point()) == SMALLER ) {
min_v = act;
}
}
vc++;
@ -240,7 +243,9 @@ public:
}
void nearest_neighbors_list(Vertex_handle v, int k, std::list<Vertex_handle>& res)
void nearest_neighbors_list(Vertex_handle v,
int k,
std::list<Vertex_handle>& res)
{
int n = number_of_vertices();
@ -253,7 +258,8 @@ public:
init_dfs();
MAP_TYPE priority_number; // here we save the priorities ...
compare_vertices<Vertex_handle,Numb_type,MAP_TYPE> comp(& priority_number); // comparison object ...
compare_vertices<Vertex_handle,Numb_type,MAP_TYPE>
comp(& priority_number); // comparison object ...
std::priority_queue<Vertex_handle, std::vector<Vertex_handle>, CGAL::compare_vertices<Vertex_handle,Numb_type,MAP_TYPE> > PQ(comp);
priority_number[& (*v)] = 0;