-void MTPGraph::update_work_length() {
- for(int n = 0; n < _nb_vertices; n++) {
- scalar_t d = vertices[n].distance_from_source;
- for(Edge *e = vertices[n].root_edge; e; e = e->next) {
- e->work_length += d - e->terminal_vertex->distance_from_source;
+void MTPGraph::print_dot(ostream *os) {
+ (*os) << "digraph {" << endl;
+ // (*os) << " node [shape=circle];" << endl;
+ (*os) << " edge [color=gray]" << endl;
+ (*os) << " " << _source->id << " [peripheries=2];" << endl;
+ (*os) << " " << _sink->id << " [peripheries=2];" << endl;
+ for(int k = 0; k < _nb_edges; k++) {
+ Edge *e = _edges + k;
+ // (*os) << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
+ // << ";"
+ // << endl;
+ if(e->occupied) {
+ (*os) << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
+ << " [style=bold,color=black,label=\"" << e->length << "\"];" << endl;
+ } else {
+ (*os) << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
+ << " [label=\"" << e->length << "\"];" << endl;