id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	revision
251	More efficient graph copying	Peter Kovacs	Alpar Juttner	"Is there any way to make graph copying faster for graph types like `List(Di)Graph` and `Smart(Di)Graph`?

Maybe we could have specialized versions of `(di)graphCopy()` for the cases when both types are the same, e.g. list or smart graph, which function would directly copy the vectors that represent the graph.

I'm not sure about the implementation, but I think this method would have two advantages:
 - It could be faster.
 - It would keep the node, arc and/or edge ids and the order of the items. Now if you have a `SmartDigraph` and copies it to another `SmartDigraph` structure, then the iteration orders of the nodes and arcs are reversed."	enhancement	new	major	LEMON 1.5 release	core	hg main