equal
deleted
inserted
replaced
12 // - if all edges e=uv with u reachable from the root have |
12 // - if all edges e=uv with u reachable from the root have |
13 //dist(v)-dist(u)>=length(e) |
13 //dist(v)-dist(u)>=length(e) |
14 #include <iostream> |
14 #include <iostream> |
15 #include <math.h> |
15 #include <math.h> |
16 |
16 |
17 #include <smart_graph.h> |
17 #include <hugo/smart_graph.h> |
18 #include <dimacs.h> |
18 #include <hugo/dimacs.h> |
19 #include <dijkstra.h> |
19 #include <hugo/dijkstra.h> |
20 #include <time_measure.h> |
20 #include <hugo/time_measure.h> |
21 #include <bin_heap.h> |
21 #include <hugo/bin_heap.h> |
22 #include <fib_heap.h> |
22 #include <hugo/fib_heap.h> |
23 |
23 |
24 using namespace hugo; |
24 using namespace hugo; |
25 |
25 |
26 int main(int, char **) { |
26 int main(int, char **) { |
27 |
27 |