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 ///////////////////////////////////////////////////////////////////////////
21 // Takes the graph description file as input and produces a dot file.
23 // EXAMPLE: ./mtp ./graph2.txt | dot -T pdf -o- | xpdf -
36 #include "mtp_graph.h"
38 //////////////////////////////////////////////////////////////////////
40 void find_best_paths(int nb_vertices,
41 int nb_edges, int *ea, int *eb, scalar_t *el,
43 int *result_edge_occupation) {
44 MTPGraph graph(nb_vertices, nb_edges, ea, eb, source, sink);
45 graph.find_best_paths(el, result_edge_occupation);
48 void dot_print(int nb_vertices,
49 int nb_edges, int *ea, int *eb, scalar_t *el,
51 int *edge_occupation) {
52 cout << "digraph {" << endl;
53 cout << " node[shape=circle];" << endl;
54 for(int e = 0; e < nb_edges; e++) {
55 if(edge_occupation[e]) {
56 cout << " " << ea[e] << " -> " << eb[e] << " [style=bold,color=black,label=\"" << el[e] << "\"];" << endl;
58 cout << " " << ea[e] << " -> " << eb[e] << " [color=gray,label=\"" << el[e] << "\"];" << endl;
64 //////////////////////////////////////////////////////////////////////
66 int main(int argc, char **argv) {
69 cerr << argv[0] << " <graph file>" << endl;
73 ifstream *file = new ifstream(argv[1]);
75 int nb_edges, nb_vertices;
80 (*file) >> nb_vertices >> nb_edges;
81 (*file) >> source >> sink;
83 scalar_t *edge_lengths = new scalar_t[nb_edges];
84 int *vertex_from = new int[nb_edges];
85 int *vertex_to = new int[nb_edges];
86 int *result_edge_occupation = new int[nb_edges];
88 for(int e = 0; e < nb_edges; e++) {
89 (*file) >> vertex_from[e] >> vertex_to[e] >> edge_lengths[e];
92 find_best_paths(nb_vertices, nb_edges,
93 vertex_from, vertex_to, edge_lengths,
95 result_edge_occupation);
97 dot_print(nb_vertices, nb_edges,
98 vertex_from, vertex_to, edge_lengths,
100 result_edge_occupation);
102 delete[] result_edge_occupation;
103 delete[] edge_lengths;
104 delete[] vertex_from;
109 cerr << "Can not open " << argv[1] << endl;