2 ///////////////////////////////////////////////////////////////////////////
3 // This program is free software: you can redistribute it and/or modify //
4 // it under the terms of the version 3 of the GNU General Public License //
5 // as published by the Free Software Foundation. //
7 // This program is distributed in the hope that it will be useful, but //
8 // WITHOUT ANY WARRANTY; without even the implied warranty of //
9 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU //
10 // General Public License for more details. //
12 // You should have received a copy of the GNU General Public License //
13 // along with this program. If not, see <http://www.gnu.org/licenses/>. //
15 // Written by and Copyright (C) Francois Fleuret //
16 // Contact <francois.fleuret@idiap.ch> for comments & bug reports //
17 ///////////////////////////////////////////////////////////////////////////
34 void update_positivized_lengths();
35 void force_positivized_lengths();
36 void find_shortest_path();
37 // Retrieve the path starting on edge e and return its length. If
38 // nodes is non-null, stores the node met along the path in it.
39 int retrieve_one_path(Edge *e, int *nodes);
41 Vertex **_front, **_new_front;
43 int _nb_vertices, _nb_edges;
44 Vertex *_source, *_sink;
51 // These variables are filled when retrieve_disjoint_paths is called
55 MTPGraph(int nb_vertices, int nb_edges, int *from, int *to,
56 int source, int sink);
60 void find_best_paths(scalar_t *lengths);
61 void retrieve_disjoint_paths();
63 void print(ostream *os);
64 void print_dot(ostream *os);