/*
* Converts a Java VertexSet to an igraph_vs_t
* @return: zero if everything went fine, 1 if a null pointer was passed
*/
int Java_net_sf_igraph_VertexSet_to_igraph_vs(JNIEnv *env, jobject jobj, igraph_vs_t *result) {
jint typeHint;
jobject idArray;
if (jobj == 0) {
IGRAPH_CHECK(igraph_vs_all(result));
return IGRAPH_SUCCESS;
}
typeHint = (*env)->CallIntMethod(env, jobj, net_sf_igraph_VertexSet_getTypeHint_mid);
if (typeHint != 1 && typeHint != 2) {
IGRAPH_CHECK(igraph_vs_all(result));
return IGRAPH_SUCCESS;
}
idArray = (*env)->CallObjectMethod(env, jobj, net_sf_igraph_VertexSet_getIdArray_mid);
if ((*env)->ExceptionCheck(env)) {
return IGRAPH_EINVAL;
}
if (typeHint == 1) {
/* Single vertex */
jlong id[1];
(*env)->GetLongArrayRegion(env, idArray, 0, 1, id);
IGRAPH_CHECK(igraph_vs_1(result, (igraph_integer_t)id[0]));
} else if (typeHint == 2) {
/* List of vertices */
jlong* ids;
igraph_vector_t vec;
long i, n;
ids = (*env)->GetLongArrayElements(env, idArray, 0);
n = (*env)->GetArrayLength(env, idArray);
IGRAPH_VECTOR_INIT_FINALLY(&vec, n);
for (i = 0; i < n; i++)
VECTOR(vec)[i] = ids[i];
IGRAPH_CHECK(igraph_vs_vector_copy(result, &vec));
igraph_vector_destroy(&vec);
IGRAPH_FINALLY_CLEAN(1);
(*env)->ReleaseLongArrayElements(env, idArray, ids, JNI_ABORT);
}
(*env)->DeleteLocalRef(env, idArray);
return IGRAPH_SUCCESS;
}
igraph_integer_t all_degrees(igraph_t *graph, igraph_vector_t *degrees)
{
igraph_vs_t vs;
igraph_vs_all(&vs);
igraph_degree(graph, degrees, vs, IGRAPH_ALL, IGRAPH_LOOPS);
igraph_vs_destroy(&vs);
}
std::vector<int> Graph::degrees() {
igraph_vector_t results;
igraph_vs_t allnds;
std::vector<int> degs;
igraph_vs_all(&allnds);
igraph_vector_init(&results, size);
igraph_vector_null(&results);
igraph_degree(graph, &results, allnds, IGRAPH_ALL, IGRAPH_NO_LOOPS);
degs.insert(degs.begin(), VECTOR(results), VECTOR(results)+size);
igraph_vector_destroy(&results);
igraph_vs_destroy(&allnds);
return degs;
}
std::vector<double> Graph::betweenness() const {
igraph_vector_t results;
igraph_vs_t allnods;
std::vector<double> bet;
igraph_vector_init(&results, size);
igraph_vector_null(&results);
igraph_vs_all(&allnods);
igraph_betweenness(graph, &results, allnods, false);
bet.insert(bet.begin(), VECTOR(results), VECTOR(results) + size);
igraph_vector_destroy(&results);
igraph_vs_destroy(&allnods);
return bet;
}
std::vector<double> Graph::closeness() const {
igraph_vector_t results;
igraph_vs_t allnods;
std::vector<double> clos;
igraph_vector_init(&results, size);
igraph_vector_null(&results);
igraph_vs_all(&allnods);
igraph_closeness(graph, &results, allnods, IGRAPH_IN);
clos.insert(clos.begin(), VECTOR(results), VECTOR(results) + size);
igraph_vector_destroy(&results);
igraph_vs_destroy(&allnods);
return clos;
}
/**
* \ingroup python_interface_vertexseq
* \brief Allocate a new vertex sequence object for a given graph
* \return the allocated PyObject
*/
PyObject* igraphmodule_VertexSeq_new(PyTypeObject *subtype,
PyObject *args, PyObject *kwds) {
igraphmodule_VertexSeqObject *o;
o=(igraphmodule_VertexSeqObject*)PyType_GenericNew(subtype, args, kwds);
if (o == NULL) return NULL;
igraph_vs_all(&o->vs);
o->gref=0;
o->weakreflist=0;
RC_ALLOC("VertexSeq", o);
return (PyObject*)o;
}
/**
* \ingroup python_interface_vertexseq
* \brief Initialize a new vertex sequence object for a given graph
* \return the initialized PyObject
*/
int igraphmodule_VertexSeq_init(igraphmodule_VertexSeqObject *self,
PyObject *args, PyObject *kwds) {
static char *kwlist[] = { "graph", "vertices", NULL };
PyObject *g, *vsobj=Py_None;
igraph_vs_t vs;
if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!|O", kwlist,
&igraphmodule_GraphType, &g, &vsobj))
return -1;
if (vsobj == Py_None) {
/* If vs is None, we are selecting all the vertices */
igraph_vs_all(&vs);
} else if (PyInt_Check(vsobj)) {
/* We selected a single vertex */
long int idx = PyInt_AsLong(vsobj);
if (idx < 0 || idx >= igraph_vcount(&((igraphmodule_GraphObject*)g)->g)) {
PyErr_SetString(PyExc_ValueError, "vertex index out of range");
return -1;
}
igraph_vs_1(&vs, (igraph_integer_t)idx);
} else {
igraph_vector_t v;
igraph_integer_t n = igraph_vcount(&((igraphmodule_GraphObject*)g)->g);
if (igraphmodule_PyObject_to_vector_t(vsobj, &v, 1))
return -1;
if (!igraph_vector_isininterval(&v, 0, n-1)) {
igraph_vector_destroy(&v);
PyErr_SetString(PyExc_ValueError, "vertex index out of range");
return -1;
}
if (igraph_vs_vector_copy(&vs, &v)) {
igraphmodule_handle_igraph_error();
igraph_vector_destroy(&v);
return -1;
}
igraph_vector_destroy(&v);
}
self->vs = vs;
Py_INCREF(g);
self->gref = (igraphmodule_GraphObject*)g;
return 0;
}
/*****************************************************************************
* Main
****************************************************************************/
int main(int argc, char **argv) {
srand ( time(NULL) );
/******************************
* Command Line Parser
******************************/
bool mono_lib(false), print_gate(false), print_solns(false), print_sat(false), print_blif(false), print_verilog(false);
int num_threads, budget;
float remove_percent(0.6);
vector<string> test_args;
po::options_description optional_args("Usage: [options]");
optional_args.add_options()
("circuit", po::value<string>(), "input circuit")
("tech_lib", po::value<string>(), "tech library")
("continue_file,c", po::value<string>(), "input report to continue from")
("mono_lib,m", po::value(&mono_lib)->zero_tokens(), "treat each gate as a nand")
("budget,b", po::value<int>(&budget)->default_value(100000000), "minisat conflict budget (-1 = unlimited)")
("remove_edges,e", po::value<float>(&remove_percent)->default_value(0.6), "edge percent to remove")
("print_graph", po::value(&print_gate)->zero_tokens(), "print H graph")
("print_solns", po::value(&print_solns)->zero_tokens(), "print isos")
("print_blif", po::value(&print_blif)->zero_tokens(), "print G blif circuit")
("print_verilog", po::value(&print_verilog)->zero_tokens(), "print verilog circuits")
("test,t", po::value< vector<string> >(&test_args), "Run test suite #: \n"
" -99: Beta Testing \n"
" -1: Mem Testing \n"
" 0: L0 [count, remove_percent] \n"
" 1: L1 [count, remove_percent] \n"
" 2: S1 - Random [min S1] \n"
" 3: S1 - Greedy [min S1] \n")
("num_threads,n", po::value<int>(&num_threads)->default_value(1), "Number of threads")
("wdir,w", po::value<string>()->default_value("./wdir"), "Output directory")
("help,h", "produce help message")
;
po::positional_options_description positional_args;
positional_args.add("circuit", 1);
positional_args.add("tech_lib", 1);
positional_args.add("test", -1);
po::variables_map vm;
try {
po::store(po::command_line_parser(argc, argv).options(optional_args).positional(positional_args).run(), vm);
po::notify(vm);
} catch(exception& e) {
cerr << "error: " << e.what() << "\n";
return 1;
} catch(...) {
cerr << "Exception of unknown type!\n";
}
if (vm.count("help")) {
cout << optional_args << "\n";
return 0;
}
string circuit_filename, circuit_name, tech_filename, tech_name, working_dir, report_filename;
// input circuit
if (vm.count("circuit") == 1) {
circuit_filename = vm["circuit"].as<string>();
circuit_name = circuit_filename.substr(circuit_filename.rfind('/')+1);
circuit_name = circuit_name.substr(0, circuit_name.find('.'));
} else {
cout << optional_args << "\n";
return 0;
}
// input tech lib
if (vm.count("tech_lib")) {
tech_filename = vm["tech_lib"].as<string>();
tech_name = tech_filename.substr(tech_filename.rfind('/')+1);
tech_name = tech_name.substr(0, tech_name.find('.'));
} else {
cout << optional_args << "\n";
return 0;
}
cout << "Circuit : " << circuit_filename << "\n";
cout << "Tech Lib: " << tech_filename << "\n";
/******************************
* Setup working dir
******************************/
working_dir = vm["wdir"].as<string>();
mkdir(working_dir.c_str(), S_IRWXU);
cout << "WDIR : " << working_dir << "\n";
/******************************
* Convert circuit using tech_lib
******************************/
string outfile = working_dir + circuit_filename.substr(circuit_filename.rfind('/'));
cout << "Outfile : " << outfile << "\n";
// sis_convert(circuit_filename, tech_filename, outfile);
cout << "I'm here!\n";
circuit_filename = outfile;
// copy tech_lib
if ( tech_filename != string(working_dir + tech_filename.substr(tech_filename.rfind('/')) ) ) {
ifstream src( tech_filename.c_str() );
ofstream dst( string(working_dir + tech_filename.substr(tech_filename.rfind('/')) ).c_str() );
dst << src.rdbuf();
dst.close();
}
/******************************
* Load circuit
******************************/
Circuit circuit;
load_circuit(&circuit, circuit_filename, mono_lib);
Security *security;
Circuit G, H;
G.copy(&circuit);
G.remove_io();
circuit.save( working_dir + "/circuit.gml" );
G.save( working_dir + "/G_circuit.gml" );
/****************************************************************
* print G
****************************************************************/
if ( test_args.size() > 0 && -1 == atoi(test_args[0].c_str())) {
G.print();
}
/****************************************************************
* L0
****************************************************************/
if ( test_args.size() > 0 && 0 == atoi(test_args[0].c_str())) {
int max_count(2);
if (test_args.size() == 2)
max_count = atoi(test_args[1].c_str());
H.copy(&G);
H.rand_del_edges(remove_percent);
H.save( working_dir + "/H_circuit.gml" );
security = new Security(&G, &H);
security->setConfBudget(budget);
cout << "Rand L0: |V(G)| = " << (int) igraph_vcount(&G);
cout << ", |E(G)| = " << (int) igraph_ecount(&G);
cout << ", |V(H)| = " << (int) igraph_vcount(&H);
cout << ", |E(H)| = " << (int) igraph_ecount(&H) << "\n";
cout << " " << boolalpha << security->L0(max_count, false) << endl;
}
/****************************************************************
* L1
****************************************************************/
if ( test_args.size() > 0 && 1 == atoi(test_args[0].c_str())) {
int max_L1(2);
if (test_args.size() == 2)
max_L1 = atoi(test_args[1].c_str());
H.copy(&G);
H.rand_del_edges(remove_percent);
if (vm.count("continue_file")) {
H.rand_del_edges((float) 1.0);
string filename = vm["continue_file"].as<string>();
ifstream file;
try {
file.open(filename.c_str());
while (file.good()) {
string line;
int L0, L1;
Edge edge;
getline(file, line);
if (parse(line, &G, L1, L0, edge)) {
if (L1 >= max_L1) {
H.add_edge(edge);
cout << "L1 = " << max_L1 << ", +<" << edge.first << "," << edge.second << ">" << endl;
}
}
}
} catch(...) {}
}
H.save( working_dir + "/H_circuit.gml" );
security = new Security(&G, &H);
security->setConfBudget(budget);
cout << "Rand L1: |V(G)| = " << (int) igraph_vcount(&G);
cout << ", |E(G)| = " << (int) igraph_ecount(&G);
cout << ", |V(H)| = " << (int) igraph_vcount(&H);
cout << ", |E(H)| = " << (int) igraph_ecount(&H) << "\n";
cout << " " << boolalpha << security->L1(max_L1, false) << endl;
}
/****************************************************************
* #L1
****************************************************************/
if ( test_args.size() == 1 && 2 == atoi(test_args[0].c_str())) {
int max_L1(2);
if (test_args.size() == 2)
max_L1 = atoi(test_args[1].c_str());
H.copy(&G);
H.rand_del_edges(remove_percent);
if (vm.count("continue_file")) {
H.rand_del_edges((float) 1.0);
string filename = vm["continue_file"].as<string>();
ifstream file;
try {
file.open(filename.c_str());
while (file.good()) {
string line;
int L0, L1;
Edge edge;
getline(file, line);
if (parse(line, &G, L1, L0, edge)) {
H.add_edge(edge);
max_L1 = L1;
cout << "L1 = " << max_L1 << ", +<" << edge.first << "," << edge.second << ">" << endl;
}
}
} catch(...) {}
}
H.save( working_dir + "/H_circuit.gml" );
security = new Security(&G, &H);
security->setConfBudget(budget);
cout << "Rand L1: |V(G)| = " << (int) igraph_vcount(&G);
cout << ", |E(G)| = " << (int) igraph_ecount(&G);
cout << ", |V(H)| = " << (int) igraph_vcount(&H);
cout << ", |E(H)| = " << (int) igraph_ecount(&H) << "\n";
cout << " " << security->L1(false);
}
/****************************************************************
* S1_rand
****************************************************************/
if ( test_args.size() == 1 && 3 == atoi(test_args[0].c_str())) {
int max_L1 = G.max_L1();
H.copy(&G);
H.rand_del_edges((float) 1.0);
security = new Security(&G, &H);
security->setConfBudget(budget);
string output;
output = "S1_rand (" + G.get_name() + ")";
output = report(output, &G, &H, max_L1);
cout << output;
security->S1_rand(num_threads);
}
/****************************************************************
* S1_greedy
****************************************************************/
if ( test_args.size() >= 1 && 4 == atoi(test_args[0].c_str())) {
int min_L1(2), max_L1 = G.max_L1();
H.copy(&G);
H.rand_del_edges((float) 1.0);
bool done(false);
if ( test_args.size() == 3 ) {
min_L1 = atoi(test_args[1].c_str());
max_L1 = atoi(test_args[2].c_str());
} else if ( test_args.size() == 2 )
min_L1 = atoi(test_args[1].c_str());
if (vm.count("continue_file")) {
string filename = vm["continue_file"].as<string>();
ifstream file;
for (int eid = 0; eid < igraph_ecount(&G); eid++)
SETEAS(&G, "style", eid, "invis");
try {
file.open(filename.c_str());
// int last_sec;
// Edge prev_edge;
// bool first = true;
while (file.good()) {
string line;
int L0, L1;
Edge edge;
getline(file, line);
if (parse(line, &G, L1, L0, edge)) {
if (L1 < min_L1) {
done = true;
break;
}
// if (first) { last_sec = L1; first = false; prev_edge = edge;}
// else
// {
// if (last_sec != L1)
// {
// H.del_edge(prev_edge);
// string gmlfilename;
// char num[3];
// sprintf(num, "%d", last_sec);
// gmlfilename = working_dir + "/H_circuit_" + num + ".gml";
// string gvfilename = working_dir + "/H_circuit_" + num + ".gv";
// string psfilename = working_dir + "/H_circuit_" + num + ".ps";
//H.save( gmlfilename );
// G.save( gmlfilename );
// H.add_edge(prev_edge);
// string command = "gml2gv -o" + gvfilename + " " + gmlfilename;
// system(command.c_str());
// command = "dot -Tps -Nstyle=filled -Ncolorscheme=accent8 -Nshape=circle -Nlabel=\"\" -o " + psfilename + " " + gvfilename;
// system(command.c_str());
// last_sec = L1;
// }
// prev_edge = edge;
// int eid;
// igraph_get_eid(&G, &eid, edge.first, edge.second, true, false);
// SETEAS(&G, "style", eid, "solid");
// }
H.add_edge(edge);
max_L1 = L1;
cout << "L1 = " << max_L1 << ", +<" << edge.first << "," << edge.second << ">" << endl;
}
}
// return 0;
} catch(...) {}
}
if ( test_args.size() == 3 ) {
min_L1 = atoi(test_args[1].c_str());
max_L1 = atoi(test_args[2].c_str());
} else if ( test_args.size() == 2 )
min_L1 = atoi(test_args[1].c_str());
security = new Security(&G, &H);
security->setConfBudget(budget);
string output;
output = "S1_greedy (" + G.get_name() + ")";
output = report(output, &G, &H, max_L1);
cout << output;
fstream report;
if (!done)
{
clock_t tic = clock();
security->S1_greedy(num_threads, min_L1, max_L1);
clock_t toc = clock();
cout << endl << "Heuristic took: ";
cout << (double) (toc-tic)/CLOCKS_PER_SEC << endl;
}
}
/****************************************************************
* k-isomorphism
****************************************************************/
if ( test_args.size() >= 1 && 10 == atoi(test_args[0].c_str())) {
int min_L1(2), max_L1 = G.max_L1();
if ( test_args.size() == 3 ) {
min_L1 = atoi(test_args[1].c_str());
max_L1 = atoi(test_args[2].c_str());
} else if ( test_args.size() == 2 )
min_L1 = atoi(test_args[1].c_str());
igraph_vector_t match_vert;
igraph_vector_init(&match_vert, 0);
for (int i = 0; i < igraph_vcount(&G); i++)
{
int color = VAN(&G, "colour", i);
if (igraph_vector_size(&match_vert) < color + 1)
for (int j = igraph_vector_size(&match_vert); j <= color; j++)
{
igraph_vector_push_back(&match_vert, 0);
}
VECTOR(match_vert)[color]++;
}
igraph_t temp;
// igraph_copy(&temp, &G);
// igraph_destroy(&G);
// for (min_L1 = max_L1; min_L1 >= 1; min_L1--) {
// igraph_copy(&G, &temp);
int count = 0;
for (int i = 0; i < igraph_vector_size(&match_vert); i++)
{
int n = ((int) VECTOR(match_vert)[i]) % min_L1; if (n == 0) continue;
for (int j = 0; j < min_L1 - n; j++)
{ count++;
igraph_add_vertices(&G, 1, 0);
SETVAN(&G, "colour", igraph_vcount(&G) - 1, i);
}
}
cout << count << " "; cout.flush();
H.copy(&G);
H.rand_del_edges((float) 1.0);
bool done(false);
security = new Security(&G, &H);
security->setConfBudget(budget);
string output;
output = "S1_greedy (" + G.get_name() + ")";
output = report(output, &G, &H, max_L1);
// cout << output;
fstream report;
if (!done)
{
clock_t tic = clock();
security->kiso(min_L1, max_L1);
clock_t toc = clock();
// cout << endl << "Heuristic took: ";
// cout << (double) (toc-tic)/CLOCKS_PER_SEC << endl;
} //igraph_destroy(&G);}
}
/****************************************************************
* Tree test
****************************************************************/
if ( test_args.size() >= 1 && 7 == atoi(test_args[0].c_str())) {
int min_L1(2), max_L1 = G.max_L1();
//G.erase();
igraph_vs_t vs;
igraph_vs_all(&vs);
igraph_delete_vertices(&G, vs);
const int depth = 7;
igraph_add_vertices(&G, pow(2,depth)-1, 0);
for (int i=0; i < pow(2,depth-1); i++)
{
int level = floor(log(i+1)/log(2));
igraph_add_edge(&G,i,pow(2,level+1) + (i-pow(2,level))*2 - 1);
igraph_add_edge(&G,i,pow(2,level+1) + (i-pow(2,level))*2);
}
for (int i=0; i < igraph_vcount(&G); i++)
{
SETVAN(&G, "colour", i, 0);
SETVAS(&G, "type", i, "invf101");
string label = "label";
SETVAS(&G, "label", i, label.c_str());
}
H.copy(&G);
for (int i=0; i < igraph_vcount(&H); i++)
{
SETVAN(&H, "colour", i, 0);
}
H.rand_del_edges((float) 1.0);
if ( test_args.size() == 3 ) {
min_L1 = atoi(test_args[1].c_str());
max_L1 = atoi(test_args[2].c_str());
} else if ( test_args.size() == 2 )
min_L1 = atoi(test_args[1].c_str());
if ( test_args.size() == 3 ) {
min_L1 = atoi(test_args[1].c_str());
max_L1 = atoi(test_args[2].c_str());
} else if ( test_args.size() == 2 )
min_L1 = atoi(test_args[1].c_str());
cout << "I'm here!"; cout.flush();
security = new Security(&G, &H);
security->setConfBudget(budget);
string output;
cout << "I'm here!";
output = "S1_greedy (" + G.get_name() + ")";
cout << "I'm here!";
output = report(output, &G, &H, max_L1);
cout << output;
cout << "I'm here!";
security->S1_greedy(num_threads, min_L1, max_L1);
}
/****************************************************************
* Compute security level G if no wires are lifted
****************************************************************/
if ( test_args.size() >= 1 && 5 == atoi(test_args[0].c_str())) {
H.copy(&G);
security = new Security(&G, &H);
security->setConfBudget(budget);
H.rand_del_edges((float) 0.0);
// security->clean_solutions();
string output;
output = "Security of circuit (" + G.get_name() + ") if no wires are lifted: ";
cout << output;
security->S1_self();
}
/****************************************************************
* Solve LIFT(G, k, eta)
****************************************************************/
if ( test_args.size() >= 1 && 6 == atoi(test_args[0].c_str())) {
int min_L1(2), max_L1 = G.max_L1(), eta = igraph_ecount(&G);
H.copy(&G);
// H.rand_del_edges((float) 1.0);
if ( test_args.size() == 3 ) {
min_L1 = atoi(test_args[1].c_str());
eta = atoi(test_args[2].c_str());
} else if ( test_args.size() == 2 )
min_L1 = atoi(test_args[1].c_str());
security = new Security(&G, &H);
security->setConfBudget(budget);
clock_t tic = clock();
security->rSAT(min_L1, max_L1, eta);
clock_t toc = clock();
cout << endl << "SAT took: ";
cout << (double) (toc-tic)/CLOCKS_PER_SEC << endl;
}
/****************************************************************
* Solve LIFT(G, k, eta, u)
****************************************************************/
if ( test_args.size() >= 1 && 8 == atoi(test_args[0].c_str())) {
int min_L1(2), max_L1 = G.max_L1(), eta = igraph_ecount(&G), u;
H.copy(&G);
// H.rand_del_edges((float) 1.0);
if ( test_args.size() == 4 ) {
u = atoi(test_args[1].c_str());
min_L1 = atoi(test_args[2].c_str());
eta = atoi(test_args[3].c_str());
} else if ( test_args.size() == 3 )
{
u = atoi(test_args[1].c_str());
min_L1 = atoi(test_args[2].c_str());
}
else if ( test_args.size() == 2 )
u = atoi(test_args[1].c_str());
security = new Security(&G, &H);
security->setConfBudget(budget);
clock_t tic = clock();
security->rSAT(min_L1, max_L1, eta, u, true);
clock_t toc = clock();
cout << endl << "SAT took: ";
cout << (double) (toc-tic)/CLOCKS_PER_SEC << endl;
}
/****************************************************************
* Solve LIFT(G, k, eta, u)
****************************************************************/
if ( test_args.size() >= 1 && 9 == atoi(test_args[0].c_str())) {
int min_L1(2), max_L1 = G.max_L1(), eta = igraph_ecount(&G), u;
H.copy(&G);
// H.rand_del_edges((float) 1.0);
if ( test_args.size() == 4 ) {
u = atoi(test_args[1].c_str());
min_L1 = atoi(test_args[2].c_str());
eta = atoi(test_args[3].c_str());
} else if ( test_args.size() == 3 )
{
u = atoi(test_args[1].c_str());
min_L1 = atoi(test_args[2].c_str());
}
else if ( test_args.size() == 2 )
u = atoi(test_args[1].c_str());
security = new Security(&G, &H);
security->setConfBudget(budget);
clock_t tic = clock();
security->rSAT(min_L1,max_L1, eta, u);
clock_t toc = clock();
cout << endl << "SAT took: ";
cout << (double) (toc-tic)/CLOCKS_PER_SEC << endl;
}
/****************************************************************
* simulated annealing
****************************************************************/
if ( test_args.size() >= 1 && 10 == atoi(test_args[0].c_str())) {
const double MAX_TEMP = 100000.0;
const int MAX_ITERATIONS = 2000;
const double TEMP_CHANGE = 0.98;
int no_of_edges = 20;
int min_L1(2), max_L1 = G.max_L1();
H.copy(&G);
H.rand_del_edges(igraph_ecount(&G) - no_of_edges);
security = new Security(&G, &H);
security->setConfBudget(budget);
int current_k_security = security->L1();
int best_k_security = current_k_security;
delete security;
double temperature = MAX_TEMP;
srand( time(NULL));
for (int iter = 0; iter < MAX_ITERATIONS; iter++) {
bool done(false);
// H.rand_del_edges(1);
vector<Edge> unlifted_edge_list;
for (int eid = 0; eid < igraph_ecount(&H); eid++) {
Edge edge = H.get_edge(eid);
unlifted_edge_list.push_back(edge);
}
random_shuffle(unlifted_edge_list.begin(), unlifted_edge_list.end());
H.del_edge(unlifted_edge_list[0]);
vector<Edge> edge_list;
for (int eid = 0; eid < igraph_ecount(&G); eid++) {
Edge edge = G.get_edge(eid);
if (!H.test_edge(edge)) edge_list.push_back(edge);
}
random_shuffle(edge_list.begin(), edge_list.end());
H.add_edge(edge_list[0]);
security = new Security(&G, &H);
security->setConfBudget(budget);
int new_k_security = security->L1();
if (new_k_security >= current_k_security) {
current_k_security = new_k_security;
if (current_k_security >= best_k_security) best_k_security = current_k_security;
}
else {
if (exp((new_k_security-current_k_security)/temperature) >= ((double) rand())/ RAND_MAX);
else {
H.add_edge(unlifted_edge_list[0]);
H.add_edge(edge_list[0]);
}
}
temperature *= TEMP_CHANGE;
if ((iter + 1 )% 10 == 0) cout << " > iteration " << iter + 1 << ", temp=" << temperature << ", best=" << best_k_security << endl;
}
}
/****************************************************************
* L1(label)
****************************************************************/
if ( test_args.size() >= 1 && 5 == atoi(test_args[0].c_str())) {
string label = "";
if (test_args.size() == 2)
label = test_args[1];
int max_L1(2);
H.copy(&G);
H.rand_del_edges(remove_percent);
if (vm.count("continue_file")) {
H.rand_del_edges((float) 1.0);
string filename = vm["continue_file"].as<string>();
ifstream file;
try {
file.open(filename.c_str());
while (file.good()) {
string line;
int L0, L1;
Edge edge;
getline(file, line);
if (parse(line, &G, L1, L0, edge)) {
H.add_edge(edge);
max_L1 = L1;
cout << "L1 = " << max_L1 << ", +<" << edge.first << "," << edge.second << ">" << endl;
}
}
} catch(...) {}
}
H.save( working_dir + "/H_circuit.gml" );
security = new Security(&G, &H);
security->setConfBudget(budget);
security->L1(label);
}
if ( test_args.size() >= 1 && atoi(test_args[0].c_str()) >= 0) {
H.save( working_dir + "/H_circuit.gml" );
delete security;
}
if (print_gate)
G.print();
if (print_blif)
print_file(circuit_filename);
if (print_solns)
security->print_solutions();
if (print_verilog)
security->print_solutions();
printf("\n\ndone 0 \n");
return 0;
}
void LayoutBuilder::produce(AbstractPetriNetBuilder *builder){
if(!attrTableAttached){
igraph_i_set_attribute_table(&igraph_cattribute_table);
attrTableAttached = true;
}
size_t V = places.size() + transitions.size();
size_t E = inArcs.size() + outArcs.size();
igraph_t graph;
// Create a directed graph
igraph_empty(&graph, V, true);
// Create vector with all edges
igraph_vector_t edges;
igraph_vector_init(&edges, E * 2);
// Add edges to vector
int i = 0;
for(ArcIter it = inArcs.begin(); it != inArcs.end(); it++){
VECTOR(edges)[i++] = numberFromName(it->start);
VECTOR(edges)[i++] = numberFromName(it->end);
}
for(ArcIter it = outArcs.begin(); it != outArcs.end(); it++){
VECTOR(edges)[i++] = numberFromName(it->start);
VECTOR(edges)[i++] = numberFromName(it->end);
}
// Add the edges to graph
igraph_add_edges(&graph, &edges, 0);
// Delete the vector with edges
igraph_vector_destroy(&edges);
// Arrays to store result in
double posx[V];
double posy[V];
// Provide current positions, if they're used at all
if(startFromCurrentPositions){
int i = 0;
for(PlaceIter it = places.begin(); it != places.end(); it++){
posx[i] = it->x;
posy[i] = it->y;
igraph_cattribute_VAN_set(&graph, "id", i, i);
i++;
}
for(TransitionIter it = transitions.begin(); it != transitions.end(); it++){
posx[i] = it->x;
posy[i] = it->y;
igraph_cattribute_VAN_set(&graph, "id", i, i);
i++;
}
}
// Decompose the graph, and layout subgraphs induvidually
igraph_vector_ptr_t subgraphs;
igraph_vector_ptr_init(&subgraphs, 0);
igraph_decompose(&graph, &subgraphs, IGRAPH_WEAK, -1, 0);
// Offset for places subgraphs
double offsetx = 0;
double offsety = 0;
// Layout, translate and extract results for each subgraph
for(int i = 0; i < igraph_vector_ptr_size(&subgraphs); i++){
//Get the subgraph
igraph_t* subgraph = (igraph_t*)VECTOR(subgraphs)[i];
// Allocate result matrix
igraph_matrix_t sublayout;
igraph_matrix_init(&sublayout, 0, 0);
// Vertex selector and iterator
igraph_vs_t vs;
igraph_vit_t vit;
// Select all and create iterator
igraph_vs_all(&vs);
igraph_vit_create(subgraph, vs, &vit);
// Initialize sublayout, using original positions
if(startFromCurrentPositions){
// Count vertices
int vertices = 0;
// Iterator over vertices to count them, hacked but it works
while(!IGRAPH_VIT_END(vit)){
vertices++;
IGRAPH_VIT_NEXT(vit);
}
//Reset vertex iterator
IGRAPH_VIT_RESET(vit);
// Resize sublayout
igraph_matrix_resize(&sublayout, vertices, 2);
// Iterator over vertices
while(!IGRAPH_VIT_END(vit)){
int subindex = (int)IGRAPH_VIT_GET(vit);
int index = (int)igraph_cattribute_VAN(subgraph, "id", subindex);
MATRIX(sublayout, subindex, 0) = posx[index];
MATRIX(sublayout, subindex, 1) = posy[index];
IGRAPH_VIT_NEXT(vit);
}
//Reset vertex iterator
IGRAPH_VIT_RESET(vit);
}
igraph_layout_kamada_kawai(subgraph, &sublayout, 1000, ((double)V)/4.0, 10, 0.99, V*V, startFromCurrentPositions);
// Other layout algorithms with reasonable parameters
//igraph_layout_kamada_kawai(subgraph, &sublayout, 1000, ((double)V)/4.0, 10, 0.99, V*V, startFromCurrentPositions);
//igraph_layout_grid_fruchterman_reingold(subgraph, &sublayout, 500, V, V*V, 1.5, V*V*V, V*V/4, startFromCurrentPositions);
//igraph_layout_fruchterman_reingold(subgraph, &sublayout, 500, V, V*V, 1.5, V*V*V, startFromCurrentPositions, NULL);
//igraph_layout_lgl(subgraph, &sublayout, 150, V, V*V, 1.5, V*V*V, sqrt(V), -1);
//Find min and max values:
double minx = DBL_MAX,
miny = DBL_MAX,
maxx = -DBL_MAX,
maxy = -DBL_MAX;
//Iterator over all vertices
while(!IGRAPH_VIT_END(vit)){
int subindex = (int)IGRAPH_VIT_GET(vit);
double x = MATRIX(sublayout, subindex, 0) * factor;
double y = MATRIX(sublayout, subindex, 1) * factor;
minx = minx < x ? minx : x;
miny = miny < y ? miny : y;
maxx = maxx > x ? maxx : x;
maxy = maxy > y ? maxy : y;
IGRAPH_VIT_NEXT(vit);
}
//Reset vertex iterator
IGRAPH_VIT_RESET(vit);
// Compute translation
double tx = margin - minx;
double ty = margin - miny;
// Decide whether to put it below or left of current content
if(maxx - minx + offsetx < maxy - miny + offsety){
tx += offsetx;
offsetx += maxx - minx + margin;
if(offsety < maxy - miny + margin)
offsety = maxy - miny + margin;
}else{
ty += offsety;
offsety += maxy - miny + margin;
if(offsetx < maxx - minx + margin)
offsetx = maxx - minx + margin;
}
// Translate and extract results
while(!IGRAPH_VIT_END(vit)){
int subindex = (int)IGRAPH_VIT_GET(vit);
int index = (int)igraph_cattribute_VAN(subgraph, "id", subindex);
double x = MATRIX(sublayout, subindex, 0) * factor;
double y = MATRIX(sublayout, subindex, 1) * factor;
posx[index] = x + tx;
posy[index] = y + ty;
IGRAPH_VIT_NEXT(vit);
}
// Destroy iterator and selector
igraph_vit_destroy(&vit);
igraph_vs_destroy(&vs);
// Destroy the sublayout
igraph_matrix_destroy(&sublayout);
// Destroy subgraph
igraph_destroy(subgraph);
free(VECTOR(subgraphs)[i]);
}
// Remove the attributes
igraph_cattribute_remove_v(&graph, "id");
// Destroy the graph
igraph_destroy(&graph);
// Insert results
i = 0;
for(PlaceIter it = places.begin(); it != places.end(); it++){
it->x = posx[i];
it->y = posy[i];
i++;
}
for(TransitionIter it = transitions.begin(); it != transitions.end(); it++){
it->x = posx[i];
it->y = posy[i];
i++;
}
// Produce variables
for(VarIter it = vars.begin(); it != vars.end(); it++)
builder->addVariable(it->name, it->initialValue, it->range);
for(BoolVarIter it = boolVars.begin(); it != boolVars.end(); it++)
builder->addBoolVariable(it->name, it->initialValue);
for(PlaceIter it = places.begin(); it != places.end(); it++)
builder->addPlace(it->name, it->tokens, it->x, it->y);
for(TransitionIter it = transitions.begin(); it != transitions.end(); it++)
builder->addTransition(it->name, it->conditions, it->assignments, it->x, it->y);
for(ArcIter it = inArcs.begin(); it != inArcs.end(); it++)
builder->addInputArc(it->start, it->end, it->weight);
for(ArcIter it = outArcs.begin(); it != outArcs.end(); it++)
builder->addInputArc(it->start, it->end, it->weight);
//Reset builder state (just in case some idoit decides to reuse it!
vars.clear();
boolVars.clear();
places.clear();
transitions.clear();
inArcs.clear();
outArcs.clear();
}
