MinLCA algorithms
|
Files | |
file | sa_greedy_random_geometric.cc |
Program to test the greedy algorithms with simulated annealing on random geometric graphs. | |
Functions | |
int | main (int argc, char **argv) |
Main function. More... | |
int main | ( | int | argc, |
char ** | argv | ||
) |
Main function.
This program needs to be executed using the following arguments:
argv[1] | Graph order (number of vertices) |
argv[2] | Square of the radius |
argv[3] | Random seed for generating graph |
argv[4] | Random seed for simulated annealing |
argv[5] | Simulated annealing steps parameter |
argv[6] | Simulated annealing stIter parameter |
argv[7] | Simulated annealing k parameter |
argv[8] | Simulated annealing lambda parameter |
argv[9] | If 1 , initial solution using BFS. If 0 , random solution. |
Definition at line 34 of file sa_greedy_random_geometric.cc.