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);
};
//////////////////////////////////////////////////////////////////////
}
}
+void Vertex::decrease_distance_in_heap(Vertex **heap) {
+ Vertex **p, **h;
+ // There is some beauty in that
+ h = heap_slot;
+ while(h > heap &&
+ (p = heap + (h - heap + 1) / 2 - 1,
+ (*p)->distance_from_source > (*h)->distance_from_source)) {
+ swap(*p, *h);
+ swap((*p)->heap_slot, (*h)->heap_slot);
+ h = p;
+ }
+}
+
+void Vertex::increase_distance_in_heap(Vertex **heap, int heap_size) {
+ Vertex **c1, **c2, **h;
+ // omg, that's beautiful
+ h = heap_slot;
+ while(c1 = heap + 2 * (h - heap) + 1,
+ c1 < heap + heap_size &&
+ (c2 = c1 + 1,
+ (*c1)->distance_from_source < (*h)->distance_from_source
+ ||
+ (c2 < heap + heap_size && (*c2)->distance_from_source < (*h)->distance_from_source)
+ )) {
+ if(c2 < heap + heap_size && (*c2)->distance_from_source <= (*c1)->distance_from_source) {
+ swap(*c2, *h);
+ swap((*c2)->heap_slot, (*h)->heap_slot);
+ h = c2;
+ } else {
+ swap(*c1, *h);
+ swap((*c1)->heap_slot, (*h)->heap_slot);
+ h = c1;
+ }
+ }
+}
+
//////////////////////////////////////////////////////////////////////
static int compare_vertex(const void *v1, const void *v2) {
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.
#endif
}
-int MTPGraph::compute_dp_distances() {
+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 **active = new Vertex *[_nb_vertices];
- // We put everybody in the active
+ // 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];
}
- int iteration = 1;
+ scalar_t rank = 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 iteration value
+ // edges to the current rank 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 = iteration;
+ e->terminal_vertex->distance_from_source = rank;
}
}
// 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 == iteration) {
+ if(v->distance_from_source == rank) {
active[nb_active++] = v;
}
}
- iteration++;
+ rank++;
} while(nb_active < pred_nb_active);
delete[] active;
return nb_active == 0;
}
-void MTPGraph::decrease_distance_in_heap(Vertex *v) {
- Vertex **p, **h;
- // There is some beauty in that
- h = v->heap_slot;
- while(h > _heap &&
- (p = _heap + (h - _heap + 1) / 2 - 1,
- (*p)->distance_from_source > (*h)->distance_from_source)) {
- swap(*p, *h);
- swap((*p)->heap_slot, (*h)->heap_slot);
- h = p;
- }
-}
-
-void MTPGraph::increase_distance_in_heap(Vertex *v) {
- Vertex **c1, **c2, **h;
- // There is some beauty in that
- h = v->heap_slot;
- while(c1 = _heap + 2 * (h - _heap + 1) - 1, c2 = c1 + 1,
- (c1 < _heap + _heap_size && (*c1)->distance_from_source < (*h)->distance_from_source)
- ||
- (c2 < _heap + _heap_size && (*c2)->distance_from_source < (*h)->distance_from_source)
- ) {
- if(c1 < _heap + _heap_size &&
- !(c2 < _heap + _heap_size && (*c2)->distance_from_source < (*c1)->distance_from_source)){
- swap(*c1, *h);
- swap((*c1)->heap_slot, (*h)->heap_slot);
- h = c1;
- } else {
- swap(*c2, *h);
- swap((*c2)->heap_slot, (*h)->heap_slot);
- h = c2;
- }
- }
-}
-
-void MTPGraph::dp_distance_propagation() {
+void MTPGraph::dp_compute_distances() {
Vertex *v, *tv;
Edge *e;
scalar_t d;
if(d < tv->distance_from_source) {
tv->distance_from_source = d;
tv->pred_edge_toward_source = e;
- decrease_distance_in_heap(tv);
+ tv->decrease_distance_in_heap(_heap);
}
}
}
_heap_size = _nb_vertices;
_source->distance_from_source = 0;
- decrease_distance_in_heap(_source);
+ _source->decrease_distance_in_heap(_heap);
do {
// Get the closest to the source
a = _heap;
b = _heap + _heap_size;
swap(*a, *b); swap((*a)->heap_slot, (*b)->heap_slot);
- increase_distance_in_heap(_heap[0]);
+ _heap[0]->increase_distance_in_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) {
ASSERT(tv->heap_slot - _heap < _heap_size);
tv->distance_from_source = d;
tv->pred_edge_toward_source = e;
- decrease_distance_in_heap(tv);
+ tv->decrease_distance_in_heap(_heap);
}
}
} while(_heap_size > 0);
_edges[e].positivized_length = _edges[e].length;
}
- // Update the distance to the source in "good order"
-
- dp_distance_propagation();
+ // Update the distances to the source in "good order"
+ dp_compute_distances();
do {
update_positivized_lengths();
projects / mtp.git / blobdiff