2 ////////////////////////////////////////////////////////////////////
5 // Written by Francois Fleuret //
6 // Contact <francois.fleuret@idiap.ch> for comments & bug reports //
9 ////////////////////////////////////////////////////////////////////
19 int main(int argc, char **argv) {
20 int nb_locations = 20;
21 int nb_time_steps = 20;
23 int nb_vertices = nb_time_steps * nb_locations + 2;
24 int nb_edges = 2 * nb_locations + (nb_time_steps - 1) * (nb_locations * nb_locations);
26 int sink = nb_vertices - 1;
28 cout << nb_vertices << " " << nb_edges << endl;
29 cout << source << " " << sink << endl;
32 for(int l = 0; l < nb_locations; l++) {
41 for(int t = 0; t < nb_time_steps - 1; t++) {
42 for(int l = 0; l < nb_locations; l++) {
43 for(int m = 0; m < nb_locations; m++) {
44 cout << 1 + (t * nb_locations + l)
46 << 1 + ((t+1) * nb_locations + m)
54 for(int l = 0; l < nb_locations; l++) {
55 cout << 1 + ((nb_time_steps-1) * nb_locations + l)