00001 // Copyright (C) 2003-2006 Laboratoire de Recherche en Informatique 00002 00003 // This file is part of Qolyester. 00004 00005 // Qolyester is free software; you can redistribute it and/or 00006 // modify it under the terms of the GNU General Public License 00007 // as published by the Free Software Foundation; either version 2 00008 // of the License, or (at your option) any later version. 00009 00010 // Qolyester is distributed in the hope that it will be useful, 00011 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00012 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00013 // GNU General Public License for more details. 00014 00015 // You should have received a copy of the GNU General Public License 00016 // along with this program; if not, write to the Free Software 00017 // Foundation, Inc., 51 Franklin Street, Fifth Floor, 00018 // Boston, MA 02110-1301, USA. 00019 00032 00033 #include "set/routes.hh" 00034 00035 #ifndef QOLYESTER_DAEMON_ALG_DIJKSTRA_HH 00036 # define QOLYESTER_DAEMON_ALG_DIJKSTRA_HH 1 00037 00038 namespace olsr { 00039 00040 namespace alg { 00041 00042 typedef cproxy_t::sym_neighborset_t::iterator sniter_t; 00043 typedef std::map<address_t, std::pair<address_t, sniter_t> > lmap_t; 00044 00045 // The Dijkstra algorithm used to calculate routes. The first 00046 // argument is a reference to the route set and the second is a 00047 // set of source node addresses. 00048 inline void dijkstra(rrouteset_t& routes, lmap_t& sources); 00049 00050 } // namespace alg 00051 00052 } // namespace olsr 00053 00054 # include "dijkstra.hxx" 00055 00056 #endif // !QOLYESTER_DAEMON_ALG_DIJKSTRA_HH