X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp.cc;h=2f9e7a98f593227e1d4d84be31d012a2865f235a;hb=9665f6b8d842f02facda1590200742482d4362fa;hp=118e521678e05f415b80173cf421f3830b0a38a2;hpb=0f54e5005de0f05d4bc400f23181301eb40f469e;p=mtp.git
diff --git a/mtp.cc b/mtp.cc
deleted file mode 100644
index 118e521..0000000
--- a/mtp.cc
+++ /dev/null
@@ -1,118 +0,0 @@
-
-///////////////////////////////////////////////////////////////////////////
-// This program is free software: you can redistribute it and/or modify //
-// it under the terms of the version 3 of the GNU General Public License //
-// as published by the Free Software Foundation. //
-// //
-// This program 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 //
-// General Public License for more details. //
-// //
-// You should have received a copy of the GNU General Public License //
-// along with this program. If not, see . //
-// //
-// Written by and Copyright (C) Francois Fleuret //
-// Contact for comments & bug reports //
-///////////////////////////////////////////////////////////////////////////
-
-// Multi-Tracked Path
-
-// Takes the graph description file as input and produces a dot file.
-
-// EXAMPLE: ./mtp ./graph2.txt | dot -T pdf -o- | xpdf -
-
-#define VERBOSE
-
-#include
-#include
-#include
-#include
-#include
-#include
-
-using namespace std;
-
-#include "mtp_graph.h"
-
-//////////////////////////////////////////////////////////////////////
-
-void find_best_paths(int nb_vertices,
- int nb_edges, int *ea, int *eb, scalar_t *el,
- int source, int sink,
- int *result_edge_occupation) {
- MTPGraph graph(nb_vertices, nb_edges, ea, eb, source, sink);
- graph.find_best_paths(el, result_edge_occupation);
-}
-
-void dot_print(int nb_vertices,
- int nb_edges, int *ea, int *eb, scalar_t *el,
- int source, int sink,
- int *edge_occupation) {
- cout << "digraph {" << endl;
- cout << " node[shape=circle];" << endl;
- for(int e = 0; e < nb_edges; e++) {
- if(edge_occupation[e]) {
- cout << " " << ea[e] << " -> " << eb[e] << " [style=bold,color=black,label=\"" << el[e] << "\"];" << endl;
- } else {
- cout << " " << ea[e] << " -> " << eb[e] << " [color=gray,label=\"" << el[e] << "\"];" << endl;
- }
- }
- cout << "}" << endl;
-}
-
-//////////////////////////////////////////////////////////////////////
-
-int main(int argc, char **argv) {
-
- if(argc < 2) {
- cerr << argv[0] << " " << endl;
- exit(EXIT_FAILURE);
- }
-
- ifstream *file = new ifstream(argv[1]);
-
- int nb_edges, nb_vertices;
- int source, sink;
-
- if(file->good()) {
-
- (*file) >> nb_vertices >> nb_edges;
- (*file) >> source >> sink;
-
- scalar_t *edge_lengths = new scalar_t[nb_edges];
- int *vertex_from = new int[nb_edges];
- int *vertex_to = new int[nb_edges];
- int *result_edge_occupation = new int[nb_edges];
-
- for(int e = 0; e < nb_edges; e++) {
- (*file) >> vertex_from[e] >> vertex_to[e] >> edge_lengths[e];
- }
-
- find_best_paths(nb_vertices, nb_edges,
- vertex_from, vertex_to, edge_lengths,
- source, sink,
- result_edge_occupation);
-
- dot_print(nb_vertices, nb_edges,
- vertex_from, vertex_to, edge_lengths,
- source, sink,
- result_edge_occupation);
-
- delete[] result_edge_occupation;
- delete[] edge_lengths;
- delete[] vertex_from;
- delete[] vertex_to;
-
- } else {
-
- cerr << "Can not open " << argv[1] << endl;
-
- delete file;
- exit(EXIT_FAILURE);
-
- }
-
- delete file;
- exit(EXIT_SUCCESS);
-}