36 lines
1.1 KiB
C++
36 lines
1.1 KiB
C++
// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
|
|
|
|
// "route.cpp"
|
|
|
|
// (c) OPAC Team, LIFL, January 2006
|
|
|
|
/* This library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2 of the License, or (at your option) any later version.
|
|
|
|
This library is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with this library; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
|
*/
|
|
|
|
#include "route.h"
|
|
|
|
unsigned length (const Route & __route) {
|
|
|
|
unsigned len = 0 ;
|
|
|
|
for (unsigned i = 0; i < numNodes; i ++)
|
|
len += distance (__route [i], __route [(i + 1) % numNodes]) ;
|
|
|
|
return len;
|
|
}
|
|
|
|
|