X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp_graph.cc;h=b83871d4df3d7065a325fb552760987d009df5cb;hb=340972b07aa40e812a99ecd2bced570cdd5eed84;hp=95dc4510af14e4cd8888e943209c8f808235d7dd;hpb=79a4a9ab164a667ecb551078e1cd773e2140e3c2;p=mtp.git

diff --git a/mtp_graph.cc b/mtp_graph.cc
index 95dc451..b83871d 100644
--- a/mtp_graph.cc
+++ b/mtp_graph.cc
@@ -82,37 +82,6 @@ void Vertex::del_edge(Edge *e) {
 
 //////////////////////////////////////////////////////////////////////
 
-void MTPGraph::print() {
-  for(int k = 0; k < _nb_edges; k++) {
-    Edge *e = _edges + k;
-    cout << e->origin_vertex->id
-         << " -> "
-         << e->terminal_vertex->id
-         << " "
-         << e->length;
-    if(e->occupied) {
-      cout << " *";
-    }
-    cout << endl;
-  }
-}
-
-void MTPGraph::print_dot() {
-  cout << "digraph {" << endl;
-  cout << "  node[shape=circle];" << endl;
-  for(int k = 0; k < _nb_edges; k++) {
-    Edge *e = _edges + k;
-    if(e->occupied) {
-      cout << "  " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
-           << " [style=bold,color=black,label=\"" << -e->length << "\"];" << endl;
-    } else {
-      cout << "  " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
-           << " [color=gray,label=\"" << e->length << "\"];" << endl;
-    }
-  }
-  cout << "}" << endl;
-}
-
 MTPGraph::MTPGraph(int nb_vertices, int nb_edges,
                    int *from, int *to,
                    int source, int sink) {
@@ -139,6 +108,8 @@ MTPGraph::MTPGraph(int nb_vertices, int nb_edges,
     _edges[e].terminal_vertex = _vertices + to[e];
   }
 
+  paths = 0;
+  nb_paths = 0;
 }
 
 MTPGraph::~MTPGraph() {
@@ -146,8 +117,45 @@ MTPGraph::~MTPGraph() {
   delete[] _edges;
   delete[] _front;
   delete[] _new_front;
+  for(int p = 0; p < nb_paths; p++) delete paths[p];
+  delete[] paths;
+}
+
+//////////////////////////////////////////////////////////////////////
+
+void MTPGraph::print() {
+  for(int k = 0; k < _nb_edges; k++) {
+    Edge *e = _edges + k;
+    cout << e->origin_vertex->id
+         << " -> "
+         << e->terminal_vertex->id
+         << " "
+         << e->length;
+    if(e->occupied) {
+      cout << " *";
+    }
+    cout << endl;
+  }
 }
 
+void MTPGraph::print_dot() {
+  cout << "digraph {" << endl;
+  cout << "  node[shape=circle];" << endl;
+  for(int k = 0; k < _nb_edges; k++) {
+    Edge *e = _edges + k;
+    if(e->occupied) {
+      cout << "  " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
+           << " [style=bold,color=black,label=\"" << -e->length << "\"];" << endl;
+    } else {
+      cout << "  " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
+           << " [color=gray,label=\"" << e->length << "\"];" << endl;
+    }
+  }
+  cout << "}" << endl;
+}
+
+//////////////////////////////////////////////////////////////////////
+
 void MTPGraph::initialize_positivized_lengths_with_min() {
   scalar_t length_min = 0;
   for(int n = 0; n < _nb_vertices; n++) {
@@ -297,3 +305,27 @@ void MTPGraph::find_best_paths(scalar_t *lengths, int *result_edge_occupation) {
     result_edge_occupation[k] = e->occupied;
   }
 }
+
+void MTPGraph::retrieve_paths() {
+  Edge *e;
+
+  for(int p = 0; p < nb_paths; p++) delete paths[p];
+  delete[] paths;
+
+  nb_paths = 0;
+  for(e = _source->leaving_edges; e; e = e->next_leaving_edge) {
+    if(e->occupied) { nb_paths++; }
+  }
+
+  paths = new Path *[nb_paths];
+
+  int p = 0;
+  for(e = _source->leaving_edges; e; e = e->next_leaving_edge) {
+    if(e->occupied) {
+      paths[p] = new Path();
+      p++;
+    }
+  }
+
+  cout << "NB_PATHS " << nb_paths << endl;
+}