Java Graph (Structure) Deep copy -

-

well, have class (vertex), contains hashset in it; , @ point, need deep copy element;

i wrote code, doesn't work; i'm working on bug several days , can't fix it... if has enough time read code , find it, i'll grateful. thank in advance.

well, here function:

public vertex getcopy(vertex copyfrom, vertex copyto, hashset<vertex> created){      copyto.setid(copyfrom.getid());     copyto.setcolor(copyfrom.getcolor());     copyto.setcount(copyfrom.getcount());     copyto.setdepth(copyfrom.getdepth());     copyto.setdistance(copyfrom.getdistance());     copyto.setheurist(copyfrom.getheurist());     copyto.setvisited(copyfrom.isvisited());     copyto.setpath(copyfrom.getpath());      created.add(copyto);      hashset<vertex> copytoneighs = new hashset<vertex>();     hashset<vertex> copyfromneighs = new hashset<vertex>();     copyfromneighs.addall(copyfrom.getneighbours());      iterator<vertex> = copyfromneighs.iterator();      while (it.hasnext()){         vertex curr = it.next();          if (!created.contains(curr)){             vertex newone = new vertex();             newone = getcopy(curr, newone, created);             copytoneighs.add(newone);         } else {             iterator<vertex> itr = created.iterator();             while (itr.hasnext()){                 vertex tmp = itr.next();                 if (tmp.equals(curr)){                     copytoneighs.add(tmp);                     break;                 }             }          }     }      copyto.setneighbours(copytoneighs);      return copyto; }

and want method copy copyfrom copyto. here how call method:

vertex newone = new vertex(); vertex newcurr = new vertex(); hashset<vertex> seen1 = new hashset<vertex>(); hashset<vertex> seen2 = new hashset<vertex>(); newone = newone.getcopy(tmp, newone, seen1); newcurr = newcurr.getcopy(curr, newcurr, seen2);

other methods (like .getneighbours(), .addneighbours())work properly, i've tested them hundreds of time;

created wrong concept. have set of nodes in "from" graph, , you're creating set of new nodes in "to" graph. created.add(copyto) add new node, "to" graph, set. when go through created.iterator see if node there, you're looking node copyfromneighs, node in "from" graph. looks me never succeed. or else result you'll have nodes in "to" graph pointing nodes in "from" graph.

basically, believe need created hashmap<vertex,vertex>, not set. "key" of hashmap node in "from" graph, , "value" corresponding node in "to" graph. then, when @ neighbors of "from" node, corresponding "to" node (if it's been copied) map, , add neighbors of newly created "to" node.


Comments

Post a Comment

Popular posts from this blog

c# - How Configure Devart dotConnect for SQLite Code First? -

-
can configure following sample code ? when run following code, error : no entity framework provider found ado.net provider invariant name 'devart.data.sqlite' setting in machine.config <system.data> <dbproviderfactories> <add name="dotconnect sqlite" invariant="devart.data.sqlite" description="devart dotconnect sqlite" type="devart.data.sqlite.sqliteproviderfactory, devart.data.sqlite, version=4.6.287.0, culture=neutral, publickeytoken=09af7300eec23701" /> </dbproviderfactories> </system.data> after add below block code in app.config <?xml version="1.0"?> <configuration>   <configsections> <!-- more information on entity framework configuration, visit http://go.microsoft.com/fwlink/?linkid=237468 --> <section name="entityframework" type="system.data.entity.internal.configfile.entityframeworksection, entit...
Read more

c++ - Clear the memory after returning a vector in a function -

-
i have function processes , stores lot of data in , returns results vector of class. amount of data stored in function tremendous , want clear storage memory of function after finished job. necessary (does function automatically clear memory) or should clear memory function? update: vector<customers> process(char* const *filename, vector<int> id) { vector<customers> list_of_customers; (perform actions) return list_of_customers; } variables defined locally within function automatically released @ end of function scope. destructors objects called, should free memory allocated objects (if objects coded correctly). example of such object std::vector . anything you've allocated new must have corresponding delete release storage. try avoid doing own allocation , use raii instead, i.e. containers or smart pointers.
Read more

erlang - Saving a digraph to mnesia is hindered because of its side-effects -

-
updated the digraph library in erlang implements data type side-effectful. each operation on data type saves new state in ets table -- instead of returning altered version of itself, more common in functional languages. the problem usage perspective, impedes effort store or pass around state in convenient way requiring me first "collect" state before can start juggle around. the closest solution have seen far serializer/deserializer , these have drawback tied current structure of digraphs instead of operating on abstract type -- prevents future proof solution. update pascal pointed out serializer utilizes interface of digraph, , hence eliminates drawback mentioned above. better, albeit still inconvenient, see no better alternative. what recommendation on how store digraphs? should go different data type altogether? thanks. i not sure understand concern. fact digraph stored in ets transparent in user interface, might want chnge either exchange digr...
Read more