void MTPGraph::print_dot(ostream *os) {
(*os) << "digraph {" << endl;
+ (*os) << " rankdir=\"LR\";" << endl;
(*os) << " node [shape=circle,width=0.75,fixedsize=true];" << endl;
(*os) << " edge [color=gray,arrowhead=open]" << endl;
(*os) << " " << _source->id << " [peripheries=2];" << endl;
// Let's be a bit paranoid
ASSERT(is_dag());
- // We use call find_shortest_path here to set properly the distance,
- // so that we can make all the edge lengths positive at the first
- // iteration.
+ // We call find_shortest_path here to set properly the distances to
+ // the source, so that we can make all the edge lengths positive at
+ // the first iteration.
find_shortest_path();
do {