inline void add_leaving_edge(Edge *e);
inline void del_leaving_edge(Edge *e);
inline void decrease_distance_in_heap(Vertex **heap);
- inline void increase_distance_in_heap(Vertex **heap, int heap_size);
+ inline void increase_distance_in_heap(Vertex **heap, Vertex **heap_bottom);
};
//////////////////////////////////////////////////////////////////////
positivized_length = - positivized_length;
origin_vertex->del_leaving_edge(this);
terminal_vertex->add_leaving_edge(this);
- Vertex *t = terminal_vertex;
- terminal_vertex = origin_vertex;
- origin_vertex = t;
+ swap(terminal_vertex, origin_vertex);
}
//////////////////////////////////////////////////////////////////////
}
}
-void Vertex::increase_distance_in_heap(Vertex **heap, int heap_size) {
+void Vertex::increase_distance_in_heap(Vertex **heap, Vertex **heap_bottom) {
Vertex **c1, **c2, **h;
// omg, that's beautiful
h = heap_slot;
while(c1 = heap + 2 * (h - heap) + 1,
- c1 < heap + heap_size &&
+ c1 < heap_bottom &&
(c2 = c1 + 1,
(*c1)->distance_from_source < (*h)->distance_from_source
||
- (c2 < heap + heap_size && (*c2)->distance_from_source < (*h)->distance_from_source)
+ (c2 < heap_bottom && (*c2)->distance_from_source < (*h)->distance_from_source)
)) {
- if(c2 < heap + heap_size && (*c2)->distance_from_source <= (*c1)->distance_from_source) {
+ if(c2 < heap_bottom && (*c2)->distance_from_source <= (*c1)->distance_from_source) {
swap(*c2, *h);
swap((*c2)->heap_slot, (*h)->heap_slot);
h = c2;
paths = 0;
nb_paths = 0;
- if(compute_dp_distances()) {
+ if(compute_dp_ranks()) {
// Here the distance_from_source field of every vertex is the
// number of DP iterations needed to update it. Hence we only have
// to process the vertex in that order.
delete[] paths;
}
+int MTPGraph::compute_dp_ranks() {
+ Vertex *v;
+ Edge *e;
+
+ // This procedure computes for each node the longest link from the
+ // source and abort if the graph is not a DAG. It works by removing
+ // successively nodes without predecessor: At the first iteration it
+ // removes the source, then the nodes with incoming edge only from
+ // the source, etc. If it can remove all the nodes that way, the
+ // graph is a DAG. If at some point it can not remove node anymore
+ // and there are some remaining nodes, the graph is not a DAG. The
+ // rank of a node is the iteration at which is it removed, and we
+ // set the distance_from_source fields to this value.
+
+ Vertex **unreached = new Vertex *[_nb_vertices];
+
+ // All the nodes are unreached at first
+ for(int k = 0; k < _nb_vertices; k++) {
+ _vertices[k].distance_from_source = 0;
+ unreached[k] = &_vertices[k];
+ }
+
+ scalar_t rank = 1;
+ int nb_unreached = _nb_vertices, pred_nb_unreached;
+
+ do {
+ // We set the distance_from_source field of all the vertices with incoming
+ // edges to the current rank value
+ for(int f = 0; f < nb_unreached; f++) {
+ v = unreached[f];
+ for(e = v->leaving_edges; e; e = e->next_leaving_edge) {
+ e->terminal_vertex->distance_from_source = rank;
+ }
+ }
+
+ pred_nb_unreached = nb_unreached;
+ nb_unreached = 0;
+
+ // We keep all the vertices with incoming nodes
+ for(int f = 0; f < pred_nb_unreached; f++) {
+ v = unreached[f];
+ if(v->distance_from_source == rank) {
+ unreached[nb_unreached++] = v;
+ }
+ }
+
+ rank++;
+ } while(nb_unreached < pred_nb_unreached);
+
+ delete[] unreached;
+
+ return nb_unreached == 0;
+}
+
//////////////////////////////////////////////////////////////////////
void MTPGraph::print(ostream *os) {
#endif
}
-int MTPGraph::compute_dp_distances() {
- Vertex *v;
- Edge *e;
-
- // This procedure computes for each node the longest link from the
- // source and abort if the graph is not a DAG. It works by removing
- // successively nodes without predecessor: At the first iteration it
- // removes the source, then the nodes with incoming edge only from
- // the source, etc. If it can remove all the nodes that way, the
- // graph is a DAG. If at some point it can not remove node anymore
- // and there are some remaining nodes, the graph is not a DAG.
-
- Vertex **active = new Vertex *[_nb_vertices];
-
- // All the nodes are active at first
- for(int k = 0; k < _nb_vertices; k++) {
- _vertices[k].distance_from_source = 0;
- active[k] = &_vertices[k];
- }
-
- scalar_t nb_iterations = 1;
- int nb_active = _nb_vertices, pred_nb_active;
-
- do {
- // We set the distance_from_source field of all the vertices with incoming
- // edges to the current nb_iterations value
- for(int f = 0; f < nb_active; f++) {
- v = active[f];
- for(e = v->leaving_edges; e; e = e->next_leaving_edge) {
- e->terminal_vertex->distance_from_source = nb_iterations;
- }
- }
-
- pred_nb_active = nb_active;
- nb_active = 0;
-
- // We keep all the vertices with incoming nodes
- for(int f = 0; f < pred_nb_active; f++) {
- v = active[f];
- if(v->distance_from_source == nb_iterations) {
- active[nb_active++] = v;
- }
- }
-
- nb_iterations++;
- } while(nb_active < pred_nb_active);
-
- delete[] active;
-
- return nb_active == 0;
-}
-
void MTPGraph::dp_compute_distances() {
Vertex *v, *tv;
Edge *e;
a = _heap;
b = _heap + _heap_size;
swap(*a, *b); swap((*a)->heap_slot, (*b)->heap_slot);
- _heap[0]->increase_distance_in_heap(_heap, _heap_size);
+ _heap[0]->increase_distance_in_heap(_heap, _heap + _heap_size);
// Now update the neighbors of the currently closest to the source
for(e = v->leaving_edges; e; e = e->next_leaving_edge) {
}
void MTPGraph::find_best_paths(scalar_t *lengths) {
- scalar_t total_length;
+ scalar_t shortest_path_length;
Vertex *v;
Edge *e;
_edges[e].positivized_length = _edges[e].length;
}
- // Update the distances to the source in "good order"
+ // Compute the distance of every node from the source by just
+ // visiting them in the proper DAG ordering we computed when
+ // building the graph
dp_compute_distances();
do {
+ // Use the current distance from the source to make all edge
+ // lengths positive
update_positivized_lengths();
+ // Fix numerical errors
force_positivized_lengths();
+
find_shortest_path();
- total_length = 0.0;
+ shortest_path_length = 0.0;
// Do we reach the sink?
if(_sink->pred_edge_toward_source) {
// original edge lengths
v = _sink;
while(v->pred_edge_toward_source) {
- total_length += v->pred_edge_toward_source->length;
+ shortest_path_length += v->pred_edge_toward_source->length;
v = v->pred_edge_toward_source->origin_vertex;
}
// If that length is negative
- if(total_length < 0.0) {
+ if(shortest_path_length < 0.0) {
#ifdef VERBOSE
- cerr << __FILE__ << ": Found a path of length " << total_length << endl;
+ cerr << __FILE__ << ": Found a path of length " << shortest_path_length << endl;
#endif
// Invert all the edges along the best path
v = _sink;
}
}
- } while(total_length < 0.0);
+ } while(shortest_path_length < 0.0);
// Put back the graph in its original state (i.e. invert edges which
// have been inverted in the process)
projects / mtp.git / blobdiff