id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	revision
94	Easy erase in list graphs	Balazs Dezso	Alpar Juttner	The arcs and nodes might be able to erase during an iteration very easy way in the list and smart graph implementations. If an iterator points to an arc or a node, and the item is deleted, then the increment should be valid operation until other change occurred on the graph. Of course, accessing such iterator should be avoided.	enhancement	new	major		core