1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
/*
* vim: ts=4 sw=4 et tw=0 wm=0
*
* libcola - A library providing force-directed network layout using the
* stress-majorization method subject to separation constraints.
*
* Copyright (C) 2006-2008 Monash University
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library in the file LICENSE; if not,
* write to the Free Software Foundation, Inc., 59 Temple Place,
* Suite 330, Boston, MA 02111-1307 USA
*
*/
#include <fstream>
#include <iostream>
#include <iomanip>
//#define TEST_AGAINST_BOOST
#ifdef TEST_AGAINST_BOOST
#include <boost/config.hpp>
#include <boost/property_map.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graphviz.hpp>
#include <boost/graph/johnson_all_pairs_shortest.hpp>
using namespace boost;
#endif // TEST_AGAINST_BOOST
#include <libcola/shortest_paths.h>
#include <cmath>
#include <time.h>
#include <assert.h>
using namespace std;
// creates a (not necessarily connected random graph) with n nodes.
vector<shortest_paths::Edge> random_graph(unsigned n) {
vector<shortest_paths::Edge> edges;
for(unsigned i=0;i<n;i++) {
for(unsigned j=i+1;j<n;j++) {
double r=(double)rand()/(double)RAND_MAX;
if(r < 0.1) {
edges.push_back(make_pair(i,j));
}
}
}
return edges;
}
clock_t lastTime;
static void resetClock() {
lastTime=clock();
}
static double getRunTime() {
clock_t time = clock()-lastTime;
return (double)time/(double)CLOCKS_PER_SEC;
}
int
main(void)
{
bool dump=false;
srand(time(0));
#ifdef TEST_AGAINST_BOOST
typedef adjacency_list<vecS, vecS, undirectedS, no_property,
property< edge_weight_t, double, property< edge_weight2_t, double > > > Graph;
Graph g;
#endif
unsigned V = 100;
vector<shortest_paths::Edge> es = random_graph(V);
unsigned E=es.size();
cout << " Test graph |V|="<<V<<",|E|="<<E<<endl;
valarray<double> weights(E);
for(unsigned i=0;i<E;i++) {
weights[i]=round((static_cast<double>(rand())/static_cast<double>(RAND_MAX))*10);
#ifdef TEST_AGAINST_BOOST
add_edge(es[i].first,es[i].second,weights[i],g);
#endif
}
#ifdef TEST_AGAINST_BOOST
vector < double >d(V, (numeric_limits < double >::max)());
typedef vector<double> weight_vec;
vector<weight_vec> D(V,weight_vec(V));
cout<<"Running boost::johnson_all_pairs_shortest_paths..."<<endl;
resetClock();
johnson_all_pairs_shortest_paths(g, D, distance_map(&d[0]));
cout<<" ...done, time="<<getRunTime()<<endl;
#endif
double** D1=new double*[V];
for(unsigned i=0;i<V;i++) {
D1[i]=new double[V];
}
cout<<"Running shortest_paths::johnsons..."<<endl;
resetClock();
shortest_paths::johnsons(V,D1,es,weights);
cout<<" ...done, time="<<getRunTime()<<endl;
double** D2=new double*[V];
for(unsigned i=0;i<V;i++) {
D2[i]=new double[V];
}
cout<<"Running shortest_paths::floyd_warshall..."<<endl;
resetClock();
shortest_paths::floyd_warshall(V,D2,es,weights);
cout<<" ...done, time="<<getRunTime()<<endl;
for (unsigned int i = 0; i < V; ++i) {
if(dump) cout << i << " -> ";
for (unsigned int j = 0; j < V; ++j) {
if(dump) cout << setw(5) << D1[i][j];
assert(D1[i][j]==D2[i][j]);
#ifdef TEST_AGAINST_BOOST
assert(D[i][j]==D2[i][j]);
#endif
}
if(dump) cout << endl;
}
#ifdef TEST_AGAINST_BOOST
if(dump) {
ofstream fout("figs/johnson-eg.dot");
fout << "graph A {\n" << "node[shape=\"circle\"]\n";
graph_traits < Graph >::edge_iterator ei, ei_end;
for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
fout << source(*ei, g) << " -- " << target(*ei, g)
<< "[label=" << get(edge_weight, g)[*ei] << "]\n";
fout << "}\n";
}
#endif
return 0;
}
|
